/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:34,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:34,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:34,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:34,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:34,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:34,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:34,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:34,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:34,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:34,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:34,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:34,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:34,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:34,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:34,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:34,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:34,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:34,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:34,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:34,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:34,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:34,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:34,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:34,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:34,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:34,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:34,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:34,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:34,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:34,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:34,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:34,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:34,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:34,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:34,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:34,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:34,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:34,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:34,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:34,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:34,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:45:34,829 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:34,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:34,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:34,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:34,831 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:34,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:34,831 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:34,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:34,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:34,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:34,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:34,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:34,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:34,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:34,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:34,833 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:34,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:34,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:34,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:34,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:34,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:34,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:34,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:34,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:34,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:34,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:34,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:34,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:34,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:34,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:35,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:35,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:35,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:35,163 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:35,164 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:35,165 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-08 12:45:35,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284109eb2/b1b9b6457281404e8b09d69c84a47763/FLAG1aa7dbbc3 [2020-07-08 12:45:35,744 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:35,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-08 12:45:35,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284109eb2/b1b9b6457281404e8b09d69c84a47763/FLAG1aa7dbbc3 [2020-07-08 12:45:36,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284109eb2/b1b9b6457281404e8b09d69c84a47763 [2020-07-08 12:45:36,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:36,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:36,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:36,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:36,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:36,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbef736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36, skipping insertion in model container [2020-07-08 12:45:36,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:36,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:36,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:36,439 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:36,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:36,469 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:36,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36 WrapperNode [2020-07-08 12:45:36,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:36,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:36,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:36,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:36,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... [2020-07-08 12:45:36,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:36,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:36,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:36,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:36,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:45:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:45:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:45:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:36,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:36,970 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:36,970 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:45:36,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:36 BoogieIcfgContainer [2020-07-08 12:45:36,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:36,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:36,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:36,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:36,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:36" (1/3) ... [2020-07-08 12:45:36,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e192424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:36, skipping insertion in model container [2020-07-08 12:45:36,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:36" (2/3) ... [2020-07-08 12:45:36,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e192424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:36, skipping insertion in model container [2020-07-08 12:45:36,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:36" (3/3) ... [2020-07-08 12:45:36,981 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-08 12:45:36,991 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:36,997 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:37,009 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:37,030 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:37,030 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:37,030 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:37,030 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:37,031 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:37,031 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:37,031 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:37,031 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-08 12:45:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:45:37,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:37,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:37,053 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1474053726, now seen corresponding path program 1 times [2020-07-08 12:45:37,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:37,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621490231] [2020-07-08 12:45:37,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-08 12:45:37,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-08 12:45:37,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-08 12:45:37,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-08 12:45:37,182 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-08 12:45:37,183 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2020-07-08 12:45:37,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {26#true} is VALID [2020-07-08 12:45:37,184 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} assume !!(~n~0 > 0);~i~0 := 0; {26#true} is VALID [2020-07-08 12:45:37,186 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-08 12:45:37,186 INFO L263 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {27#false} is VALID [2020-07-08 12:45:37,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-08 12:45:37,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-08 12:45:37,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-08 12:45:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:37,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621490231] [2020-07-08 12:45:37,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:37,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:45:37,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79571372] [2020-07-08 12:45:37,199 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-08 12:45:37,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:37,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:45:37,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:37,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:45:37,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:45:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:37,254 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-08 12:45:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,355 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2020-07-08 12:45:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:45:37,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-08 12:45:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-08 12:45:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-08 12:45:37,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2020-07-08 12:45:37,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:37,519 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:45:37,519 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 12:45:37,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 12:45:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-08 12:45:37,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:37,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-08 12:45:37,572 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:45:37,572 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:45:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,578 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-08 12:45:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:45:37,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:37,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:37,579 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:45:37,580 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:45:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,584 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-08 12:45:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:45:37,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:37,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:37,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:37,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:45:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-08 12:45:37,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2020-07-08 12:45:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:37,591 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-08 12:45:37,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:45:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:45:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:45:37,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:37,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:37,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:37,594 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:37,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1462047953, now seen corresponding path program 1 times [2020-07-08 12:45:37,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:37,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854970176] [2020-07-08 12:45:37,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-08 12:45:37,666 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-08 12:45:37,667 INFO L263 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2020-07-08 12:45:37,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-08 12:45:37,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-08 12:45:37,668 INFO L263 TraceCheckUtils]: 3: Hoare triple {152#true} call #t~ret3 := main(); {152#true} is VALID [2020-07-08 12:45:37,668 INFO L280 TraceCheckUtils]: 4: Hoare triple {152#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {152#true} is VALID [2020-07-08 12:45:37,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {152#true} assume !!(~n~0 > 0);~i~0 := 0; {156#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-08 12:45:37,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {153#false} is VALID [2020-07-08 12:45:37,670 INFO L263 TraceCheckUtils]: 7: Hoare triple {153#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {153#false} is VALID [2020-07-08 12:45:37,671 INFO L280 TraceCheckUtils]: 8: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2020-07-08 12:45:37,671 INFO L280 TraceCheckUtils]: 9: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2020-07-08 12:45:37,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {153#false} assume !false; {153#false} is VALID [2020-07-08 12:45:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:37,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854970176] [2020-07-08 12:45:37,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:37,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:37,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171222953] [2020-07-08 12:45:37,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-08 12:45:37,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:37,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:37,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:37,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:37,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:37,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:37,696 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2020-07-08 12:45:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,763 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-08 12:45:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:37,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-08 12:45:37,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-08 12:45:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-08 12:45:37,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-08 12:45:37,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:37,816 INFO L225 Difference]: With dead ends: 27 [2020-07-08 12:45:37,817 INFO L226 Difference]: Without dead ends: 20 [2020-07-08 12:45:37,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-08 12:45:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-08 12:45:37,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:37,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-08 12:45:37,835 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 12:45:37,835 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 12:45:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,838 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-08 12:45:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-08 12:45:37,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:37,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:37,839 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 12:45:37,840 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 12:45:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:37,843 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-08 12:45:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-08 12:45:37,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:37,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:37,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:37,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:45:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-08 12:45:37,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2020-07-08 12:45:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:37,848 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-08 12:45:37,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-08 12:45:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:45:37,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:37,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:37,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:37,849 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1463775831, now seen corresponding path program 1 times [2020-07-08 12:45:37,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:37,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399683290] [2020-07-08 12:45:37,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:37,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 12:45:38,000 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-08 12:45:38,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-08 12:45:38,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-08 12:45:38,001 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-08 12:45:38,001 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret3 := main(); {268#true} is VALID [2020-07-08 12:45:38,002 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 12:45:38,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 12:45:38,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 12:45:38,007 INFO L263 TraceCheckUtils]: 7: Hoare triple {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:38,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {275#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:38,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {275#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {269#false} is VALID [2020-07-08 12:45:38,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-08 12:45:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:38,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399683290] [2020-07-08 12:45:38,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:38,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:45:38,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088220805] [2020-07-08 12:45:38,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-08 12:45:38,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:38,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:45:38,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:38,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:45:38,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:38,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:45:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:45:38,030 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2020-07-08 12:45:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:38,262 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-08 12:45:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:45:38,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-08 12:45:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:45:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-08 12:45:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:45:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-08 12:45:38,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-08 12:45:38,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:38,310 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:45:38,310 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:45:38,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:45:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-08 12:45:38,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:38,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-08 12:45:38,331 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-08 12:45:38,331 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-08 12:45:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:38,334 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 12:45:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 12:45:38,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:38,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:38,336 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-08 12:45:38,336 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-08 12:45:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:38,339 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 12:45:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 12:45:38,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:38,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:38,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:38,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:45:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-08 12:45:38,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2020-07-08 12:45:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:38,343 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-08 12:45:38,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:45:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:45:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:45:38,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:38,344 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:38,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:38,345 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -541842987, now seen corresponding path program 1 times [2020-07-08 12:45:38,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:38,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984230964] [2020-07-08 12:45:38,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:38,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:45:38,589 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-08 12:45:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:38,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-08 12:45:38,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-08 12:45:38,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:45:38,620 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 12:45:38,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-08 12:45:38,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:45:38,621 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-08 12:45:38,622 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret3 := main(); {409#true} is VALID [2020-07-08 12:45:38,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 12:45:38,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 12:45:38,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 12:45:38,629 INFO L263 TraceCheckUtils]: 7: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {409#true} is VALID [2020-07-08 12:45:38,629 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-08 12:45:38,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-08 12:45:38,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-08 12:45:38,631 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 12:45:38,632 INFO L280 TraceCheckUtils]: 12: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {419#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-08 12:45:38,633 INFO L280 TraceCheckUtils]: 13: Hoare triple {419#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {420#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-08 12:45:38,635 INFO L263 TraceCheckUtils]: 14: Hoare triple {420#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {421#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:38,635 INFO L280 TraceCheckUtils]: 15: Hoare triple {421#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {422#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:38,636 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-08 12:45:38,636 INFO L280 TraceCheckUtils]: 17: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-08 12:45:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:38,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984230964] [2020-07-08 12:45:38,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:38,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:45:38,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251874792] [2020-07-08 12:45:38,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:38,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:38,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:45:38,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:38,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:45:38,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:45:38,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:38,673 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-07-08 12:45:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:39,003 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 12:45:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:45:39,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-08 12:45:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-08 12:45:39,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-08 12:45:39,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:39,050 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:45:39,050 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:45:39,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:45:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:45:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-08 12:45:39,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:39,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-08 12:45:39,073 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-08 12:45:39,073 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-08 12:45:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:39,076 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:45:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:45:39,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:39,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:39,077 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-08 12:45:39,077 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-08 12:45:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:39,080 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-08 12:45:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 12:45:39,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:39,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:39,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:39,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:45:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-08 12:45:39,083 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2020-07-08 12:45:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:39,083 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-08 12:45:39,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:45:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 12:45:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:45:39,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:39,085 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:39,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:45:39,085 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash 814692392, now seen corresponding path program 1 times [2020-07-08 12:45:39,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:39,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692242861] [2020-07-08 12:45:39,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:39,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:39,140 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:39,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:39,162 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:45:39,163 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:45:39,164 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:39,165 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:45:39,166 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:45:39,167 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 12:45:39,167 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:45:39,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:39 BoogieIcfgContainer [2020-07-08 12:45:39,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:39,172 INFO L168 Benchmark]: Toolchain (without parser) took 2980.55 ms. Allocated memory was 139.5 MB in the beginning and 245.4 MB in the end (delta: 105.9 MB). Free memory was 103.0 MB in the beginning and 192.3 MB in the end (delta: -89.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,173 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.21 ms. Allocated memory is still 139.5 MB. Free memory was 102.8 MB in the beginning and 93.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,175 INFO L168 Benchmark]: Boogie Preprocessor took 107.62 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 179.6 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,176 INFO L168 Benchmark]: RCFGBuilder took 395.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 161.9 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,177 INFO L168 Benchmark]: TraceAbstraction took 2194.28 ms. Allocated memory was 201.3 MB in the beginning and 245.4 MB in the end (delta: 44.0 MB). Free memory was 161.9 MB in the beginning and 192.3 MB in the end (delta: -30.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:39,181 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.21 ms. Allocated memory is still 139.5 MB. Free memory was 102.8 MB in the beginning and 93.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.62 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 179.6 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.87 ms. Allocated memory is still 201.3 MB. Free memory was 179.6 MB in the beginning and 161.9 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2194.28 ms. Allocated memory was 201.3 MB in the beginning and 245.4 MB in the end (delta: 44.0 MB). Free memory was 161.9 MB in the beginning and 192.3 MB in the end (delta: -30.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 VAL [i=0, n=1, x=0, y=0] [L20] COND TRUE i