java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/nec20_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:31,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:31,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:31,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:31,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:31,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:31,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:31,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:31,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:31,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:31,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:31,596 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:31,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:31,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:31,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:31,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:31,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:31,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:31,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:31,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:31,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:31,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:31,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:31,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:31,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:31,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:31,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:31,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:31,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:31,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:31,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:31,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:31,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:31,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:31,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:31,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:31,640 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:31,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:31,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:31,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:31,665 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:31,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:31,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:31,666 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:31,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:31,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:31,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:31,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:31,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:31,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:31,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:31,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:31,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:31,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:31,671 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:31,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:31,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:31,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:31,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:31,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:31,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:31,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:31,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:31,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:31,674 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:31,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:31,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:31,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:31,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:31,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:31,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:31,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:31,742 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:31,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec20_false-unreach-call_true-termination.i [2018-11-23 13:02:31,836 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd22b826/1257d9ae7d40479d8fcb8af4025f9dea/FLAG9ac3e84a1 [2018-11-23 13:02:32,282 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:32,283 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20_false-unreach-call_true-termination.i [2018-11-23 13:02:32,289 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd22b826/1257d9ae7d40479d8fcb8af4025f9dea/FLAG9ac3e84a1 [2018-11-23 13:02:32,662 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd22b826/1257d9ae7d40479d8fcb8af4025f9dea [2018-11-23 13:02:32,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:32,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:32,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:32,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:32,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:32,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:32" (1/1) ... [2018-11-23 13:02:32,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:32, skipping insertion in model container [2018-11-23 13:02:32,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:32" (1/1) ... [2018-11-23 13:02:32,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:32,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:32,977 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:32,982 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:33,002 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:33,016 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:33,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33 WrapperNode [2018-11-23 13:02:33,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:33,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:33,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:33,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:33,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:33,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:33,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:33,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:33,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (1/1) ... [2018-11-23 13:02:33,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:33,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:33,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:33,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:33,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (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 [2018-11-23 13:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:33,726 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:33,726 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:33,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:33 BoogieIcfgContainer [2018-11-23 13:02:33,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:33,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:33,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:33,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:33,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:32" (1/3) ... [2018-11-23 13:02:33,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab41db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:33, skipping insertion in model container [2018-11-23 13:02:33,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:33" (2/3) ... [2018-11-23 13:02:33,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab41db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:33, skipping insertion in model container [2018-11-23 13:02:33,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:33" (3/3) ... [2018-11-23 13:02:33,736 INFO L112 eAbstractionObserver]: Analyzing ICFG nec20_false-unreach-call_true-termination.i [2018-11-23 13:02:33,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:33,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:33,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:33,809 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:33,810 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:33,810 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:33,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:33,811 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:33,811 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:33,811 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:33,811 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:33,812 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 13:02:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:02:33,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:33,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:33,843 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:33,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash -676339564, now seen corresponding path program 1 times [2018-11-23 13:02:33,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:33,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:34,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 13:02:34,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} ~b~0 := 0; {28#true} is VALID [2018-11-23 13:02:34,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 13:02:34,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #52#return; {28#true} is VALID [2018-11-23 13:02:34,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret3 := main(); {28#true} is VALID [2018-11-23 13:02:34,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; {28#true} is VALID [2018-11-23 13:02:34,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume 0 != ~k~0 % 256;~n~0 := 0; {30#(<= 0 main_~n~0)} is VALID [2018-11-23 13:02:34,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#(<= 0 main_~n~0)} ~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {31#(<= main_~i~0 main_~n~0)} is VALID [2018-11-23 13:02:34,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#(<= main_~i~0 main_~n~0)} assume !(~j~0 > 10000); {31#(<= main_~i~0 main_~n~0)} is VALID [2018-11-23 13:02:34,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#(<= main_~i~0 main_~n~0)} assume !(~i~0 <= ~n~0); {29#false} is VALID [2018-11-23 13:02:34,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~a~0 := ~a~0[~i~0 := 0];~a~0 := ~a~0[~j~0 := 0]; {29#false} is VALID [2018-11-23 13:02:34,077 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); {29#false} is VALID [2018-11-23 13:02:34,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 13:02:34,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 13:02:34,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 13:02:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:34,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:34,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:02:34,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:34,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:02:34,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:34,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:34,240 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2018-11-23 13:02:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:34,695 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 13:02:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:34,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:02:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 13:02:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2018-11-23 13:02:34,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2018-11-23 13:02:34,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:34,918 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:02:34,918 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:02:34,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:34,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:02:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:02:35,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:35,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:02:35,092 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:02:35,092 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:02:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:35,098 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 13:02:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 13:02:35,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:35,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:35,101 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:02:35,101 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:02:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:35,105 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 13:02:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 13:02:35,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:35,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:35,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:35,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:02:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 13:02:35,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-11-23 13:02:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:35,112 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 13:02:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 13:02:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:02:35,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:35,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:35,114 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:35,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2087974871, now seen corresponding path program 1 times [2018-11-23 13:02:35,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:35,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:35,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:35,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:35,219 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~b~0)|=1026, ~b~0=1026] [?] ~b~0 := 0; VAL [|old(~b~0)|=1026, ~b~0=0] [?] assume true; VAL [|old(~b~0)|=1026, ~b~0=0] [?] RET #52#return; VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [?] ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; VAL [main_~k~0=257, ~b~0=0] [?] assume 0 != ~k~0 % 256;~n~0 := 0; VAL [main_~k~0=257, main_~n~0=0, ~b~0=0] [?] ~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=0, main_~j~0=1023, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !(~j~0 > 10000); VAL [main_~i~0=0, main_~j~0=1023, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !!(~i~0 <= ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;~j~0 := 2 + ~j~0; VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] ~a~0 := ~a~0[~i~0 := 0];~a~0 := ~a~0[~j~0 := 0]; VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] ensures true; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] assume 0 != ~k~0 % 256; [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25-L26] assume !(~j~0 > 10000); VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] assume !!(~i~0 <= ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] assume !(~i~0 <= ~n~0); VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0 := ~a~0[~i~0 := 0]; [L34] ~a~0 := ~a~0[~j~0 := 0]; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] ensures true; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] assume 0 != ~k~0 % 256; [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25-L26] assume !(~j~0 > 10000); VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] assume !!(~i~0 <= ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] assume !(~i~0 <= ~n~0); VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0 := ~a~0[~i~0 := 0]; [L34] ~a~0 := ~a~0[~j~0 := 0]; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L10] int b; VAL [\old(b)=1026, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=1] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=1, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=1023, k=1, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=1025, k=1, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=1025, k=1, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=1025, k=1, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] ----- [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:35,260 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:35,261 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:02:35,262 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2018-11-23 13:02:35,263 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:02:35,264 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:02:35,265 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2018-11-23 13:02:35,265 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. [2018-11-23 13:02:35,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:35 BoogieIcfgContainer [2018-11-23 13:02:35,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:35,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:35,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:35,269 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:35,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:33" (3/4) ... [2018-11-23 13:02:35,273 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~b~0)|=1026, ~b~0=1026] [?] ~b~0 := 0; VAL [|old(~b~0)|=1026, ~b~0=0] [?] assume true; VAL [|old(~b~0)|=1026, ~b~0=0] [?] RET #52#return; VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [?] ~k~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~n~0;havoc ~j~0;havoc ~a~0; VAL [main_~k~0=257, ~b~0=0] [?] assume 0 != ~k~0 % 256;~n~0 := 0; VAL [main_~k~0=257, main_~n~0=0, ~b~0=0] [?] ~i~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=0, main_~j~0=1023, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !(~j~0 > 10000); VAL [main_~i~0=0, main_~j~0=1023, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !!(~i~0 <= ~n~0);#t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2;~j~0 := 2 + ~j~0; VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] ~a~0 := ~a~0[~i~0 := 0];~a~0 := ~a~0[~j~0 := 0]; VAL [main_~i~0=1, main_~j~0=1025, main_~k~0=257, main_~n~0=0, ~b~0=0] [?] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~b~0=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] ensures true; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] assume 0 != ~k~0 % 256; [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25-L26] assume !(~j~0 > 10000); VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] assume !!(~i~0 <= ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] assume !(~i~0 <= ~n~0); VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0 := ~a~0[~i~0 := 0]; [L34] ~a~0 := ~a~0[~j~0 := 0]; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] ensures true; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] assume 0 != ~k~0 % 256; [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25-L26] assume !(~j~0 > 10000); VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] assume !!(~i~0 <= ~n~0); [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] assume !(~i~0 <= ~n~0); VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0 := ~a~0[~i~0 := 0]; [L34] ~a~0 := ~a~0[~j~0 := 0]; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~b~0)=1026, ~b~0=1026] [L10] ~b~0 := 0; VAL [old(~b~0)=1026, ~b~0=0] [?] RET call ULTIMATE.init(); VAL [~b~0=0] [?] CALL call #t~ret3 := main(); VAL [~b~0=0] [L13] ~k~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] havoc ~i~0; [L14] havoc ~n~0; [L14] havoc ~j~0; [L15] havoc ~a~0; VAL [~b~0=0, ~k~0=257] [L17-L21] COND TRUE 0 != ~k~0 % 256 [L18] ~n~0 := 0; VAL [~b~0=0, ~k~0=257, ~n~0=0] [L23] ~i~0 := 0; [L24] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L24] ~j~0 := #t~nondet1; [L24] havoc #t~nondet1; VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L25] COND FALSE !(~j~0 > 10000) VAL [~b~0=0, ~i~0=0, ~j~0=1023, ~k~0=257, ~n~0=0] [L28-L31] COND FALSE !(!(~i~0 <= ~n~0)) [L29] #t~post2 := ~i~0; [L29] ~i~0 := 1 + #t~post2; [L29] havoc #t~post2; [L30] ~j~0 := 2 + ~j~0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L28-L31] COND TRUE !(~i~0 <= ~n~0) VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L33] ~a~0[~i~0] := 0; [L34] ~a~0[~j~0] := 0; VAL [~b~0=0, ~i~0=1, ~j~0=1025, ~k~0=257, ~n~0=0] [L35] CALL call __VERIFIER_assert((if ~j~0 < 1025 then 1 else 0)); VAL [#in~cond=0, ~b~0=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~b~0=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~b~0=0, ~cond=0] [L10] int b; VAL [\old(b)=1026, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=1] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=1, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=1023, k=1, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=1025, k=1, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=1025, k=1, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=1025, k=1, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] ----- [2018-11-23 13:02:35,340 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/nec20_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:35,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:35,342 INFO L168 Benchmark]: Toolchain (without parser) took 2669.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -700.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:35,344 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:35,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:35,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:35,346 INFO L168 Benchmark]: Boogie Preprocessor took 27.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:35,347 INFO L168 Benchmark]: RCFGBuilder took 659.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:35,348 INFO L168 Benchmark]: TraceAbstraction took 1539.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:35,353 INFO L168 Benchmark]: Witness Printer took 72.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:35,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 342.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 22.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 659.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1539.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * Witness Printer took 72.14 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int b; VAL [\old(b)=1026, b=0] [L13] _Bool k=__VERIFIER_nondet_bool(); [L14] int i,n,j; [L15] int a[1025]; VAL [b=0, k=1] [L17] COND TRUE \read(k) [L18] n=0 VAL [b=0, k=1, n=0] [L23] i=0 [L24] j=__VERIFIER_nondet_int() [L25] COND FALSE !(j > 10000) VAL [b=0, i=0, j=1023, k=1, n=0] [L28] COND TRUE i <= n [L29] i++ [L30] j= j +2 VAL [b=0, i=1, j=1025, k=1, n=0] [L28] COND FALSE !(i <= n) VAL [b=0, i=1, j=1025, k=1, n=0] [L33] a[i]=0 [L34] a[j]=0 VAL [b=0, i=1, j=1025, k=1, n=0] [L35] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, b=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 14 SDslu, 31 SDs, 0 SdLazy, 10 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...