/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:22,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:22,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:22,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:22,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:22,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:22,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:22,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:22,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:22,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:22,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:22,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:22,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:22,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:22,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:22,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:22,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:22,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:22,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:22,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:22,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:22,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:22,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:22,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:22,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:22,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:22,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:22,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:22,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:22,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:22,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:22,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:22,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:22,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:22,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:22,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:22,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:22,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:22,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:22,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:22,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:22,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:22,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:22,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:22,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:22,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:22,686 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:22,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:22,686 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:22,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:22,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:22,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:22,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:22,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:22,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:22,690 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:22,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:22,691 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:22,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:22,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:22,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:22,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:22,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:22,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:22,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:22,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:22,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:22,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:22,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:22,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:22,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:22,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:23,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:23,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:23,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:23,031 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:23,032 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:23,032 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-10 15:29:23,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015ce472b/1df36a473cb4493bb56bd4d2a8d1f9e0/FLAGb041226d7 [2020-07-10 15:29:23,655 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:23,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-10 15:29:23,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015ce472b/1df36a473cb4493bb56bd4d2a8d1f9e0/FLAGb041226d7 [2020-07-10 15:29:24,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015ce472b/1df36a473cb4493bb56bd4d2a8d1f9e0 [2020-07-10 15:29:24,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:24,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:24,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:24,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:24,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:24,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eaef255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24, skipping insertion in model container [2020-07-10 15:29:24,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:24,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:24,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:24,264 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:24,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:24,304 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:24,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24 WrapperNode [2020-07-10 15:29:24,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:24,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:24,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:24,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:24,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... [2020-07-10 15:29:24,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:24,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:24,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:24,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:24,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:24,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:24,881 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:24,881 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:24,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:24 BoogieIcfgContainer [2020-07-10 15:29:24,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:24,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:24,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:24,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:24,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:24" (1/3) ... [2020-07-10 15:29:24,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e532b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:24, skipping insertion in model container [2020-07-10 15:29:24,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:24" (2/3) ... [2020-07-10 15:29:24,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e532b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:24, skipping insertion in model container [2020-07-10 15:29:24,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:24" (3/3) ... [2020-07-10 15:29:24,900 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2020-07-10 15:29:24,916 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:24,926 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:24,945 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:24,976 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:24,977 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:24,977 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:24,977 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:24,978 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:24,978 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:24,978 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:24,978 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 15:29:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:25,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:25,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:25,011 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -362650722, now seen corresponding path program 1 times [2020-07-10 15:29:25,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:25,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002793325] [2020-07-10 15:29:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:25,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:25,525 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #54#return; {24#true} is VALID [2020-07-10 15:29:25,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 15:29:25,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:25,529 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #54#return; {24#true} is VALID [2020-07-10 15:29:25,530 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2020-07-10 15:29:25,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-10 15:29:25,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {24#true} is VALID [2020-07-10 15:29:25,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {28#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 15:29:25,536 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {29#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2020-07-10 15:29:25,538 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {30#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-10 15:29:25,541 INFO L263 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {31#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:25,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {31#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {32#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:25,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {25#false} is VALID [2020-07-10 15:29:25,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 15:29:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:25,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002793325] [2020-07-10 15:29:25,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:25,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:29:25,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558220983] [2020-07-10 15:29:25,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:29:25,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:25,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:29:25,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:25,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:29:25,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:25,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:29:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:25,618 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 7 states. [2020-07-10 15:29:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,174 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-10 15:29:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:26,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-10 15:29:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-10 15:29:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-10 15:29:26,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-10 15:29:26,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:26,355 INFO L225 Difference]: With dead ends: 47 [2020-07-10 15:29:26,355 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:29:26,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:29:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:29:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:29:26,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:26,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:26,414 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:26,414 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,418 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:26,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:26,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:26,419 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:26,419 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,423 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:26,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:26,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:26,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:26,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:29:26,428 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-10 15:29:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:26,429 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:29:26,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:29:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:29:26,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:26,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:26,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:26,431 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1126137131, now seen corresponding path program 1 times [2020-07-10 15:29:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:26,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877228235] [2020-07-10 15:29:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 15:29:26,733 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-10 15:29:26,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2020-07-10 15:29:26,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 15:29:26,734 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-10 15:29:26,734 INFO L263 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-10 15:29:26,735 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {151#true} is VALID [2020-07-10 15:29:26,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {151#true} is VALID [2020-07-10 15:29:26,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {155#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-10 15:29:26,743 INFO L280 TraceCheckUtils]: 7: Hoare triple {155#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)))} assume !!(0 != ~x~0);#t~post2 := ~x~0;~x~0 := #t~post2 - 1;havoc #t~post2;~y~0 := ~y~0 - 2;#t~post3 := ~z~0;~z~0 := 1 + #t~post3;havoc #t~post3; {156#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-10 15:29:26,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {156#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {157#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2020-07-10 15:29:26,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {157#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {158#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-10 15:29:26,750 INFO L263 TraceCheckUtils]: 10: Hoare triple {158#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {159#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:26,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {159#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {160#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:26,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {160#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {152#false} is VALID [2020-07-10 15:29:26,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-10 15:29:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:26,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877228235] [2020-07-10 15:29:26,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366454187] [2020-07-10 15:29:26,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:29:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:27,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2020-07-10 15:29:27,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 15:29:27,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #54#return; {151#true} is VALID [2020-07-10 15:29:27,095 INFO L263 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-10 15:29:27,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1; {151#true} is VALID [2020-07-10 15:29:27,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {151#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {151#true} is VALID [2020-07-10 15:29:27,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {182#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= 0 main_~z~0))} is VALID [2020-07-10 15:29:27,099 INFO L280 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0) (= 0 main_~z~0))} assume !!(0 != ~x~0);#t~post2 := ~x~0;~x~0 := #t~post2 - 1;havoc #t~post2;~y~0 := ~y~0 - 2;#t~post3 := ~z~0;~z~0 := 1 + #t~post3;havoc #t~post3; {186#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 (+ main_~x~0 1)) (= 1 main_~z~0))} is VALID [2020-07-10 15:29:27,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {186#(and (= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 (+ main_~x~0 1)) (= 1 main_~z~0))} assume !(0 != ~x~0); {190#(and (= main_~j~0 (+ main_~y~0 2)) (= 1 main_~i~0) (= 1 main_~z~0))} is VALID [2020-07-10 15:29:27,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {190#(and (= main_~j~0 (+ main_~y~0 2)) (= 1 main_~i~0) (= 1 main_~z~0))} assume ~i~0 == ~j~0; {194#(and (= 0 (+ main_~y~0 1)) (= 1 main_~z~0))} is VALID [2020-07-10 15:29:27,104 INFO L263 TraceCheckUtils]: 10: Hoare triple {194#(and (= 0 (+ main_~y~0 1)) (= 1 main_~z~0))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:27,106 INFO L280 TraceCheckUtils]: 11: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:27,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {152#false} is VALID [2020-07-10 15:29:27,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-10 15:29:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:27,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:27,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-10 15:29:27,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291994826] [2020-07-10 15:29:27,112 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-10 15:29:27,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:27,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:29:27,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:29:27,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:29:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:29:27,149 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2020-07-10 15:29:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,627 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:29:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:29:27,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-10 15:29:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2020-07-10 15:29:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2020-07-10 15:29:27,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 19 transitions. [2020-07-10 15:29:27,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,665 INFO L225 Difference]: With dead ends: 18 [2020-07-10 15:29:27,666 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:27,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:29:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:27,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:27,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,673 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,673 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,677 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,677 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,678 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:27,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:27,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-10 15:29:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:27,680 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:27,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:29:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:27,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:27,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:28,024 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:28,024 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:28,024 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:28,024 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:28,025 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:28,025 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-10 15:29:28,026 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 31) no Hoare annotation was computed. [2020-07-10 15:29:28,026 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:28,026 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 31) no Hoare annotation was computed. [2020-07-10 15:29:28,026 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2020-07-10 15:29:28,027 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (+ main_~y~0 main_~z~0))) (and (<= .cse0 0) (<= 0 .cse0))) [2020-07-10 15:29:28,027 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0 main_~z~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 15:29:28,027 INFO L268 CegarLoopResult]: For program point L22-3(lines 13 31) no Hoare annotation was computed. [2020-07-10 15:29:28,028 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-10 15:29:28,028 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:28,028 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:28,028 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:28,028 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:28,028 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:28,029 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:28,035 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:28,036 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:28,037 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:28,037 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:28,037 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:28,037 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:28,037 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:28,038 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:28,043 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:28,044 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:28,044 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:28,044 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:28,045 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:28,045 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:28,045 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:28,050 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:28,050 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 15:29:28,051 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 15:29:28,054 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:28,055 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 15:29:28,055 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-10 15:29:28,055 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:29:28,055 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:29:28,055 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:28 BoogieIcfgContainer [2020-07-10 15:29:28,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:28,087 INFO L168 Benchmark]: Toolchain (without parser) took 4061.88 ms. Allocated memory was 137.4 MB in the beginning and 248.5 MB in the end (delta: 111.1 MB). Free memory was 100.8 MB in the beginning and 176.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,090 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.50 ms. Allocated memory is still 137.4 MB. Free memory was 100.4 MB in the beginning and 90.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,093 INFO L168 Benchmark]: Boogie Preprocessor took 132.84 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.2 MB in the beginning and 182.0 MB in the end (delta: -91.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,095 INFO L168 Benchmark]: RCFGBuilder took 448.97 ms. Allocated memory is still 201.9 MB. Free memory was 182.0 MB in the beginning and 162.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,098 INFO L168 Benchmark]: TraceAbstraction took 3188.65 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 162.3 MB in the beginning and 176.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:28,107 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.50 ms. Allocated memory is still 137.4 MB. Free memory was 100.4 MB in the beginning and 90.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.84 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.2 MB in the beginning and 182.0 MB in the end (delta: -91.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 448.97 ms. Allocated memory is still 201.9 MB. Free memory was 182.0 MB in the beginning and 162.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3188.65 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 162.3 MB in the beginning and 176.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x + j <= i + y + z && i + y + z <= x + j - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.9s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 SDtfs, 25 SDslu, 131 SDs, 0 SdLazy, 95 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 33 HoareAnnotationTreeSize, 10 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 77 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 3025 SizeOfPredicates, 5 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...