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/loop-lit/gcnr2008_false-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:36,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:36,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:36,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:36,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:36,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:36,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:36,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:36,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:36,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:36,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:36,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:36,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:36,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:36,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:36,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:36,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:36,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:36,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:36,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:36,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:36,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:36,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:36,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:36,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:36,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:36,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:36,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:36,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:36,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:36,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:36,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:36,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:36,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:36,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:36,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:36,361 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:12:36,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:36,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:36,378 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:36,378 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:36,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:36,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:36,379 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:36,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:36,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:36,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:36,380 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:36,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:36,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:36,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:36,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:36,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:36,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:36,381 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:36,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:36,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:36,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:36,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:36,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:36,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:36,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:36,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:36,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:36,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:36,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:36,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:36,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:36,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:36,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:36,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:36,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:36,446 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:36,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gcnr2008_false-unreach-call_false-termination.i [2018-11-23 13:12:36,504 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3271a2c28/976521bce55c420a96076288c592f025/FLAG8930ca68c [2018-11-23 13:12:36,978 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:36,981 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gcnr2008_false-unreach-call_false-termination.i [2018-11-23 13:12:36,988 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3271a2c28/976521bce55c420a96076288c592f025/FLAG8930ca68c [2018-11-23 13:12:37,473 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3271a2c28/976521bce55c420a96076288c592f025 [2018-11-23 13:12:37,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:37,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:37,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:37,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:37,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:37,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79191f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37, skipping insertion in model container [2018-11-23 13:12:37,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:37,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:37,789 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:37,794 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:37,817 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:37,832 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:37,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37 WrapperNode [2018-11-23 13:12:37,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:37,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:37,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:37,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:37,843 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:12:37" (1/1) ... [2018-11-23 13:12:37,849 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:12:37" (1/1) ... [2018-11-23 13:12:37,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:37,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:37,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:37,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:37,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (1/1) ... [2018-11-23 13:12:37,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:37,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:37,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:37,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:37,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (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:12:38,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:38,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:38,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:38,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:38,660 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:38,661 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:38,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:38 BoogieIcfgContainer [2018-11-23 13:12:38,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:38,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:38,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:38,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:38,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:37" (1/3) ... [2018-11-23 13:12:38,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161137a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:38, skipping insertion in model container [2018-11-23 13:12:38,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:37" (2/3) ... [2018-11-23 13:12:38,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161137a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:38, skipping insertion in model container [2018-11-23 13:12:38,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:38" (3/3) ... [2018-11-23 13:12:38,670 INFO L112 eAbstractionObserver]: Analyzing ICFG gcnr2008_false-unreach-call_false-termination.i [2018-11-23 13:12:38,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:38,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:38,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:38,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:38,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:38,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:38,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:38,743 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:38,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:38,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:38,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:38,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:12:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:38,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:38,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:38,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:38,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1706723647, now seen corresponding path program 1 times [2018-11-23 13:12:38,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:12:38,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:12:38,934 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2018-11-23 13:12:38,934 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 13:12:38,934 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~x~0;havoc ~y~0;havoc ~z~0;havoc ~w~0;~w~0 := 0;~z~0 := ~w~0;~y~0 := ~z~0;~x~0 := ~y~0; {27#true} is VALID [2018-11-23 13:12:38,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 13:12:38,936 INFO L256 TraceCheckUtils]: 6: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); {28#false} is VALID [2018-11-23 13:12:38,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:12:38,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:12:38,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:12:38,939 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:12:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:38,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:38,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:38,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:39,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:39,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:39,021 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 13:12:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,214 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:12:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:39,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2018-11-23 13:12:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2018-11-23 13:12:39,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 43 transitions. [2018-11-23 13:12:39,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:39,550 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:12:39,550 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:12:39,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:12:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:12:39,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:39,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:39,633 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:39,633 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,636 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 13:12:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:12:39,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,638 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:39,638 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:12:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,641 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-23 13:12:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:12:39,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:39,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 13:12:39,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-11-23 13:12:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:39,647 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 13:12:39,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:12:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:12:39,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:39,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:39,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:39,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2024305743, now seen corresponding path program 1 times [2018-11-23 13:12:39,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:39,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:39,706 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #56#return; [?] CALL call #t~ret4 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;havoc ~w~0;~w~0 := 0;~z~0 := ~w~0;~y~0 := ~z~0;~x~0 := ~y~0; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1 && ~y~0 < 10000);havoc #t~nondet1; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0] [?] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] assume !(0 != #t~nondet1 && ~y~0 < 10000); [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] assume !(0 != #t~nondet1 && ~y~0 < 10000); [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L11] int x,y,z,w; [L12] EXPR w = 0 [L12] EXPR z = w = 0 [L12] EXPR y = z = w = 0 [L12] x = y = z = w = 0 VAL [w=0, x=0, y=0, z=0] [L13] COND FALSE !(__VERIFIER_nondet_int() && y < 10000) [L28] CALL __VERIFIER_assert(x >= 4 && y <= 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:12:39,737 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:12:39,737 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:12:39,737 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:12:39,738 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 13:12:39,739 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:12:39,740 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:12:39,741 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:12:39,742 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 13:12:39,742 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:12:39,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:39 BoogieIcfgContainer [2018-11-23 13:12:39,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:39,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:39,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:39,745 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:39,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:38" (3/4) ... [2018-11-23 13:12:39,748 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #56#return; [?] CALL call #t~ret4 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~0;havoc ~w~0;~w~0 := 0;~z~0 := ~w~0;~y~0 := ~z~0;~x~0 := ~y~0; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1 && ~y~0 < 10000);havoc #t~nondet1; VAL [main_~w~0=0, main_~x~0=0, main_~y~0=0, main_~z~0=0] [?] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] assume !(0 != #t~nondet1 && ~y~0 < 10000); [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] assume !(0 != #t~nondet1 && ~y~0 < 10000); [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L11] havoc ~x~0; [L11] havoc ~y~0; [L11] havoc ~z~0; [L11] havoc ~w~0; [L12] ~w~0 := 0; [L12] ~z~0 := ~w~0; [L12] ~y~0 := ~z~0; [L12] ~x~0 := ~y~0; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#t~nondet1=0, ~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L13-L27] COND TRUE !(0 != #t~nondet1 && ~y~0 < 10000) [L13] havoc #t~nondet1; VAL [~w~0=0, ~x~0=0, ~y~0=0, ~z~0=0] [L28] CALL call __VERIFIER_assert((if ~x~0 >= 4 && ~y~0 <= 2 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L11] int x,y,z,w; [L12] EXPR w = 0 [L12] EXPR z = w = 0 [L12] EXPR y = z = w = 0 [L12] x = y = z = w = 0 VAL [w=0, x=0, y=0, z=0] [L13] COND FALSE !(__VERIFIER_nondet_int() && y < 10000) [L28] CALL __VERIFIER_assert(x >= 4 && y <= 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:12:39,802 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/gcnr2008_false-unreach-call_false-termination.i-witness.graphml [2018-11-23 13:12:39,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:39,804 INFO L168 Benchmark]: Toolchain (without parser) took 2320.69 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -659.0 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:39,806 INFO L168 Benchmark]: CDTParser took 0.18 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:12:39,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.60 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:39,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.04 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:12:39,808 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 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:12:39,809 INFO L168 Benchmark]: RCFGBuilder took 775.45 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -725.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:39,810 INFO L168 Benchmark]: TraceAbstraction took 1082.10 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:39,810 INFO L168 Benchmark]: Witness Printer took 58.06 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:39,815 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.18 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. * CACSL2BoogieTranslator took 347.60 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.04 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.71 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 775.45 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 675.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -725.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1082.10 ms. Allocated memory is still 2.1 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Witness Printer took 58.06 ms. Allocated memory is still 2.1 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int x,y,z,w; [L12] EXPR w = 0 [L12] EXPR z = w = 0 [L12] EXPR y = z = w = 0 [L12] x = y = z = w = 0 VAL [w=0, x=0, y=0, z=0] [L13] COND FALSE !(__VERIFIER_nondet_int() && y < 10000) [L28] CALL __VERIFIER_assert(x >= 4 && y <= 2) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 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...