/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-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:47:39,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:47:39,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:47:39,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:47:39,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:47:39,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:47:39,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:47:39,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:47:39,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:47:39,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:47:39,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:47:39,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:47:39,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:47:39,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:47:39,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:47:39,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:47:39,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:47:39,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:47:39,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:47:39,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:47:39,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:47:39,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:47:39,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:47:39,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:47:39,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:47:39,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:47:39,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:47:39,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:47:39,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:47:39,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:47:39,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:47:39,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:47:39,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:47:39,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:47:39,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:47:39,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:47:39,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:47:39,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:47:39,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:47:39,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:47:39,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:47:39,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:47:40,011 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:47:40,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:47:40,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:47:40,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:47:40,016 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:47:40,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:47:40,016 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:47:40,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:47:40,017 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:47:40,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:47:40,018 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:47:40,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:47:40,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:47:40,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:47:40,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:47:40,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:47:40,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:40,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:47:40,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:47:40,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:47:40,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:47:40,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:47:40,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:47:40,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:47:40,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:47:40,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:47:40,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:47:40,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:47:40,402 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:47:40,403 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:47:40,404 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2020-07-08 12:47:40,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150146bfb/adcd03d314f24f3fb483dce0f24c7030/FLAGc3d13a8be [2020-07-08 12:47:41,070 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:47:41,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-08 12:47:41,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150146bfb/adcd03d314f24f3fb483dce0f24c7030/FLAGc3d13a8be [2020-07-08 12:47:41,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150146bfb/adcd03d314f24f3fb483dce0f24c7030 [2020-07-08 12:47:41,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:47:41,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:47:41,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:41,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:47:41,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:47:41,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c36148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41, skipping insertion in model container [2020-07-08 12:47:41,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:47:41,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:47:41,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:41,695 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:47:41,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:41,743 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:47:41,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41 WrapperNode [2020-07-08 12:47:41,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:41,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:47:41,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:47:41,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:47:41,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... [2020-07-08 12:47:41,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:47:41,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:47:41,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:47:41,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:47:41,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:47:41,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:47:41,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:47:41,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:47:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:47:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:47:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:47:41,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:47:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:47:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:47:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:47:41,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:47:41,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:47:42,349 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:47:42,350 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:47:42,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:42 BoogieIcfgContainer [2020-07-08 12:47:42,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:47:42,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:47:42,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:47:42,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:47:42,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:47:41" (1/3) ... [2020-07-08 12:47:42,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceae62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:42, skipping insertion in model container [2020-07-08 12:47:42,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:41" (2/3) ... [2020-07-08 12:47:42,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceae62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:42, skipping insertion in model container [2020-07-08 12:47:42,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:42" (3/3) ... [2020-07-08 12:47:42,370 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-08 12:47:42,388 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:47:42,396 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:47:42,415 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:47:42,444 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:47:42,444 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:47:42,444 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:47:42,444 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:47:42,444 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:47:42,445 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:47:42,445 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:47:42,445 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:47:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-08 12:47:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:47:42,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:42,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:42,487 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash -961315073, now seen corresponding path program 1 times [2020-07-08 12:47:42,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:42,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527329459] [2020-07-08 12:47:42,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:42,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:47:42,668 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-08 12:47:42,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-08 12:47:42,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:47:42,670 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-08 12:47:42,670 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-08 12:47:42,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {24#true} is VALID [2020-07-08 12:47:42,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {24#true} is VALID [2020-07-08 12:47:42,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-08 12:47:42,674 INFO L263 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {25#false} is VALID [2020-07-08 12:47:42,675 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-08 12:47:42,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-08 12:47:42,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-08 12:47:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:42,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527329459] [2020-07-08 12:47:42,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:42,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:47:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89315926] [2020-07-08 12:47:42,689 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-08 12:47:42,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:42,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:47:42,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:42,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:47:42,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:47:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:42,797 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-08 12:47:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:42,890 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-08 12:47:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:47:42,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-08 12:47:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-08 12:47:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-08 12:47:42,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-08 12:47:43,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:43,017 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:47:43,018 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:47:43,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:47:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:47:43,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:43,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:43,073 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:43,074 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:43,079 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-08 12:47:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:47:43,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:43,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:43,081 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:43,081 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:43,085 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-08 12:47:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:47:43,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:43,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:43,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:43,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:47:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-08 12:47:43,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-07-08 12:47:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:43,094 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-08 12:47:43,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:47:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:47:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-08 12:47:43,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:43,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:43,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:47:43,098 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash -971473804, now seen corresponding path program 1 times [2020-07-08 12:47:43,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:43,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330482179] [2020-07-08 12:47:43,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:43,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-08 12:47:43,420 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-08 12:47:43,421 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-08 12:47:43,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-08 12:47:43,422 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-08 12:47:43,422 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret3 := main(); {121#true} is VALID [2020-07-08 12:47:43,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {125#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 12:47:43,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {126#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 12:47:43,427 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 12:47:43,429 INFO L263 TraceCheckUtils]: 7: Hoare triple {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:43,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {129#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:43,431 INFO L280 TraceCheckUtils]: 9: Hoare triple {129#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {122#false} is VALID [2020-07-08 12:47:43,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-08 12:47:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:43,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330482179] [2020-07-08 12:47:43,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:43,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:47:43,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229633955] [2020-07-08 12:47:43,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-08 12:47:43,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:43,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:47:43,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:43,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:47:43,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:47:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:47:43,459 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2020-07-08 12:47:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:43,780 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-08 12:47:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:43,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-08 12:47:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-08 12:47:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-08 12:47:43,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2020-07-08 12:47:43,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:43,865 INFO L225 Difference]: With dead ends: 26 [2020-07-08 12:47:43,865 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:47:43,867 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-08 12:47:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:47:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2020-07-08 12:47:43,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:43,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 15 states. [2020-07-08 12:47:43,886 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 15 states. [2020-07-08 12:47:43,886 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 15 states. [2020-07-08 12:47:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:43,889 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-08 12:47:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-08 12:47:43,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:43,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:43,891 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 21 states. [2020-07-08 12:47:43,891 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 21 states. [2020-07-08 12:47:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:43,895 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-08 12:47:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-08 12:47:43,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:43,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:43,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:43,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:47:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-08 12:47:43,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2020-07-08 12:47:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:43,901 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-08 12:47:43,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:47:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-08 12:47:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:47:43,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:43,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:43,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:47:43,903 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -18708286, now seen corresponding path program 1 times [2020-07-08 12:47:43,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:43,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735756007] [2020-07-08 12:47:43,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:44,177 INFO L280 TraceCheckUtils]: 0: Hoare triple {239#true} assume true; {239#true} is VALID [2020-07-08 12:47:44,178 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {239#true} {239#true} #50#return; {239#true} is VALID [2020-07-08 12:47:44,178 INFO L263 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2020-07-08 12:47:44,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#true} assume true; {239#true} is VALID [2020-07-08 12:47:44,179 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {239#true} {239#true} #50#return; {239#true} is VALID [2020-07-08 12:47:44,180 INFO L263 TraceCheckUtils]: 3: Hoare triple {239#true} call #t~ret3 := main(); {239#true} is VALID [2020-07-08 12:47:44,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {239#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {243#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:44,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {243#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {244#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:44,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {244#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {245#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:44,186 INFO L280 TraceCheckUtils]: 7: Hoare triple {245#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {246#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:44,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {246#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {247#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:44,192 INFO L280 TraceCheckUtils]: 9: Hoare triple {247#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {240#false} is VALID [2020-07-08 12:47:44,193 INFO L263 TraceCheckUtils]: 10: Hoare triple {240#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {240#false} is VALID [2020-07-08 12:47:44,193 INFO L280 TraceCheckUtils]: 11: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2020-07-08 12:47:44,194 INFO L280 TraceCheckUtils]: 12: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2020-07-08 12:47:44,194 INFO L280 TraceCheckUtils]: 13: Hoare triple {240#false} assume !false; {240#false} is VALID [2020-07-08 12:47:44,195 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-08 12:47:44,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735756007] [2020-07-08 12:47:44,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537724638] [2020-07-08 12:47:44,197 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-08 12:47:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:44,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-08 12:47:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:44,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:44,529 INFO L263 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2020-07-08 12:47:44,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#true} assume true; {239#true} is VALID [2020-07-08 12:47:44,530 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {239#true} {239#true} #50#return; {239#true} is VALID [2020-07-08 12:47:44,530 INFO L263 TraceCheckUtils]: 3: Hoare triple {239#true} call #t~ret3 := main(); {239#true} is VALID [2020-07-08 12:47:44,531 INFO L280 TraceCheckUtils]: 4: Hoare triple {239#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {243#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:44,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {243#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {266#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:44,534 INFO L280 TraceCheckUtils]: 6: Hoare triple {266#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {270#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-08 12:47:44,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {270#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {274#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-08 12:47:44,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {274#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {278#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} is VALID [2020-07-08 12:47:44,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {240#false} is VALID [2020-07-08 12:47:44,544 INFO L263 TraceCheckUtils]: 10: Hoare triple {240#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {240#false} is VALID [2020-07-08 12:47:44,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2020-07-08 12:47:44,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2020-07-08 12:47:44,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {240#false} assume !false; {240#false} is VALID [2020-07-08 12:47:44,547 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-08 12:47:44,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:44,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-08 12:47:44,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87808923] [2020-07-08 12:47:44,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-08 12:47:44,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:44,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:47:44,589 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-08 12:47:44,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:47:44,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:47:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:47:44,592 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2020-07-08 12:47:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,099 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-08 12:47:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:47:45,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-08 12:47:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:47:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-07-08 12:47:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:47:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2020-07-08 12:47:45,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2020-07-08 12:47:45,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:45,168 INFO L225 Difference]: With dead ends: 29 [2020-07-08 12:47:45,169 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:47:45,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:47:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:47:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-08 12:47:45,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:45,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2020-07-08 12:47:45,187 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2020-07-08 12:47:45,187 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2020-07-08 12:47:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,189 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-08 12:47:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:47:45,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:45,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:45,191 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2020-07-08 12:47:45,191 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2020-07-08 12:47:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,194 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-08 12:47:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:47:45,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:45,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:45,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:45,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:47:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 12:47:45,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2020-07-08 12:47:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:45,198 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 12:47:45,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:47:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 12:47:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:47:45,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:45,199 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:45,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:47:45,414 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1620020812, now seen corresponding path program 2 times [2020-07-08 12:47:45,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:45,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070746570] [2020-07-08 12:47:45,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:45,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:45,592 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {407#true} {407#true} #50#return; {407#true} is VALID [2020-07-08 12:47:45,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2020-07-08 12:47:45,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:45,593 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #50#return; {407#true} is VALID [2020-07-08 12:47:45,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {407#true} call #t~ret3 := main(); {407#true} is VALID [2020-07-08 12:47:45,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {407#true} is VALID [2020-07-08 12:47:45,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,595 INFO L280 TraceCheckUtils]: 6: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,600 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 12:47:45,602 INFO L280 TraceCheckUtils]: 9: Hoare triple {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 12:47:45,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {408#false} is VALID [2020-07-08 12:47:45,603 INFO L280 TraceCheckUtils]: 11: Hoare triple {408#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#false} is VALID [2020-07-08 12:47:45,603 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#false} assume !(~i~0 < 2 * ~k~0); {408#false} is VALID [2020-07-08 12:47:45,604 INFO L263 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {408#false} is VALID [2020-07-08 12:47:45,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2020-07-08 12:47:45,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2020-07-08 12:47:45,605 INFO L280 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2020-07-08 12:47:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:45,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070746570] [2020-07-08 12:47:45,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710616937] [2020-07-08 12:47:45,606 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:45,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:45,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:45,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:47:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:45,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:45,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:45,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:47:45,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2020-07-08 12:47:45,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#true} assume true; {407#true} is VALID [2020-07-08 12:47:45,771 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {407#true} {407#true} #50#return; {407#true} is VALID [2020-07-08 12:47:45,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {407#true} call #t~ret3 := main(); {407#true} is VALID [2020-07-08 12:47:45,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {407#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {407#true} is VALID [2020-07-08 12:47:45,773 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,774 INFO L280 TraceCheckUtils]: 6: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 12:47:45,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(and (<= main_~i~0 0) (<= 0 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 12:47:45,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 12:47:45,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {412#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {408#false} is VALID [2020-07-08 12:47:45,784 INFO L280 TraceCheckUtils]: 11: Hoare triple {408#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#false} is VALID [2020-07-08 12:47:45,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#false} assume !(~i~0 < 2 * ~k~0); {408#false} is VALID [2020-07-08 12:47:45,785 INFO L263 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {408#false} is VALID [2020-07-08 12:47:45,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2020-07-08 12:47:45,786 INFO L280 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2020-07-08 12:47:45,786 INFO L280 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2020-07-08 12:47:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:45,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:45,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-08 12:47:45,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210910396] [2020-07-08 12:47:45,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:47:45,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:45,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 12:47:45,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:45,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 12:47:45,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 12:47:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:47:45,824 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2020-07-08 12:47:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,931 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-08 12:47:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 12:47:45,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 12:47:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:47:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-08 12:47:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 12:47:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2020-07-08 12:47:45,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2020-07-08 12:47:45,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:45,974 INFO L225 Difference]: With dead ends: 28 [2020-07-08 12:47:45,975 INFO L226 Difference]: Without dead ends: 20 [2020-07-08 12:47:45,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 12:47:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-08 12:47:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-08 12:47:45,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:45,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2020-07-08 12:47:45,988 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2020-07-08 12:47:45,988 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2020-07-08 12:47:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,990 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 12:47:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 12:47:45,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:45,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:45,991 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2020-07-08 12:47:45,991 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2020-07-08 12:47:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:45,993 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 12:47:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 12:47:45,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:45,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:45,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:45,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:47:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-08 12:47:45,996 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2020-07-08 12:47:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:45,996 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-08 12:47:45,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 12:47:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-08 12:47:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 12:47:45,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:45,997 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:46,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:46,210 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 154986550, now seen corresponding path program 1 times [2020-07-08 12:47:46,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:46,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634308180] [2020-07-08 12:47:46,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:46,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {571#true} assume true; {571#true} is VALID [2020-07-08 12:47:46,662 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {571#true} {571#true} #50#return; {571#true} is VALID [2020-07-08 12:47:46,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2020-07-08 12:47:46,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2020-07-08 12:47:46,663 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #50#return; {571#true} is VALID [2020-07-08 12:47:46,664 INFO L263 TraceCheckUtils]: 3: Hoare triple {571#true} call #t~ret3 := main(); {571#true} is VALID [2020-07-08 12:47:46,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {571#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {575#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:46,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {576#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:46,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {576#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {576#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:46,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {576#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {577#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 12:47:46,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {577#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {578#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 12:47:46,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {578#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} assume !!(~i~0 < 2 * ~k~0); {579#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:46,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {579#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {579#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:46,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {579#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:46,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {580#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {581#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:46,676 INFO L263 TraceCheckUtils]: 13: Hoare triple {581#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {582#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:46,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {582#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {583#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:46,677 INFO L280 TraceCheckUtils]: 15: Hoare triple {583#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {572#false} is VALID [2020-07-08 12:47:46,677 INFO L280 TraceCheckUtils]: 16: Hoare triple {572#false} assume !false; {572#false} is VALID [2020-07-08 12:47:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:46,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634308180] [2020-07-08 12:47:46,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192284454] [2020-07-08 12:47:46,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:46,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-08 12:47:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:46,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:47,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:47,047 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:47,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:47,093 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:47:47,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2020-07-08 12:47:47,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2020-07-08 12:47:47,185 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #50#return; {571#true} is VALID [2020-07-08 12:47:47,186 INFO L263 TraceCheckUtils]: 3: Hoare triple {571#true} call #t~ret3 := main(); {571#true} is VALID [2020-07-08 12:47:47,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {571#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {575#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:47,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {602#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:47,192 INFO L280 TraceCheckUtils]: 6: Hoare triple {602#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {602#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:47,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {602#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {609#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {609#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {613#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,197 INFO L280 TraceCheckUtils]: 9: Hoare triple {613#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {617#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,215 INFO L280 TraceCheckUtils]: 10: Hoare triple {617#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {617#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {617#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {624#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,228 INFO L280 TraceCheckUtils]: 12: Hoare triple {624#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(~i~0 < 2 * ~k~0); {628#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:47,232 INFO L263 TraceCheckUtils]: 13: Hoare triple {628#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:47,234 INFO L280 TraceCheckUtils]: 14: Hoare triple {632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:47,235 INFO L280 TraceCheckUtils]: 15: Hoare triple {636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {572#false} is VALID [2020-07-08 12:47:47,235 INFO L280 TraceCheckUtils]: 16: Hoare triple {572#false} assume !false; {572#false} is VALID [2020-07-08 12:47:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:47,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:47,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-07-08 12:47:47,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198761541] [2020-07-08 12:47:47,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-08 12:47:47,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:47,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 12:47:47,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:47,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 12:47:47,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 12:47:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2020-07-08 12:47:47,295 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 19 states. [2020-07-08 12:47:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:48,075 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-07-08 12:47:48,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 12:47:48,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-08 12:47:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:47:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2020-07-08 12:47:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:47:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2020-07-08 12:47:48,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 49 transitions. [2020-07-08 12:47:48,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:48,161 INFO L225 Difference]: With dead ends: 41 [2020-07-08 12:47:48,161 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 12:47:48,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2020-07-08 12:47:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 12:47:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2020-07-08 12:47:48,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:48,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2020-07-08 12:47:48,187 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2020-07-08 12:47:48,187 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2020-07-08 12:47:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:48,190 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-08 12:47:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-08 12:47:48,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:48,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:48,191 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2020-07-08 12:47:48,191 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2020-07-08 12:47:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:48,193 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-08 12:47:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-08 12:47:48,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:48,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:48,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:48,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:47:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-07-08 12:47:48,196 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2020-07-08 12:47:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:48,196 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-07-08 12:47:48,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 12:47:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:47:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:47:48,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:48,198 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:48,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:48,411 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1782214080, now seen corresponding path program 2 times [2020-07-08 12:47:48,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:48,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785970726] [2020-07-08 12:47:48,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:48,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {809#true} assume true; {809#true} is VALID [2020-07-08 12:47:48,644 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {809#true} {809#true} #50#return; {809#true} is VALID [2020-07-08 12:47:48,644 INFO L263 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2020-07-08 12:47:48,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {809#true} assume true; {809#true} is VALID [2020-07-08 12:47:48,644 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {809#true} {809#true} #50#return; {809#true} is VALID [2020-07-08 12:47:48,645 INFO L263 TraceCheckUtils]: 3: Hoare triple {809#true} call #t~ret3 := main(); {809#true} is VALID [2020-07-08 12:47:48,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {809#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {813#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:48,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:48,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:48,651 INFO L280 TraceCheckUtils]: 7: Hoare triple {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {815#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:48,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {815#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:48,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:48,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:48,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {816#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:48,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {814#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {817#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:48,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {817#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {818#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:48,662 INFO L280 TraceCheckUtils]: 14: Hoare triple {818#(and (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {819#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:48,663 INFO L280 TraceCheckUtils]: 15: Hoare triple {819#(and (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {810#false} is VALID [2020-07-08 12:47:48,663 INFO L263 TraceCheckUtils]: 16: Hoare triple {810#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {810#false} is VALID [2020-07-08 12:47:48,663 INFO L280 TraceCheckUtils]: 17: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2020-07-08 12:47:48,663 INFO L280 TraceCheckUtils]: 18: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2020-07-08 12:47:48,664 INFO L280 TraceCheckUtils]: 19: Hoare triple {810#false} assume !false; {810#false} is VALID [2020-07-08 12:47:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:47:48,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785970726] [2020-07-08 12:47:48,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457436744] [2020-07-08 12:47:48,666 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:48,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:48,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:48,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:47:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:48,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:49,001 INFO L263 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2020-07-08 12:47:49,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {809#true} assume true; {809#true} is VALID [2020-07-08 12:47:49,002 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {809#true} {809#true} #50#return; {809#true} is VALID [2020-07-08 12:47:49,002 INFO L263 TraceCheckUtils]: 3: Hoare triple {809#true} call #t~ret3 := main(); {809#true} is VALID [2020-07-08 12:47:49,003 INFO L280 TraceCheckUtils]: 4: Hoare triple {809#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {813#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:49,004 INFO L280 TraceCheckUtils]: 5: Hoare triple {813#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {838#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:49,004 INFO L280 TraceCheckUtils]: 6: Hoare triple {838#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {838#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:49,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {838#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {845#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {845#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {849#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {859#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,011 INFO L280 TraceCheckUtils]: 12: Hoare triple {859#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {863#(and (= 2 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:49,012 INFO L280 TraceCheckUtils]: 13: Hoare triple {863#(and (= 2 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {867#(and (= 2 main_~i~0) (<= 2 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:49,013 INFO L280 TraceCheckUtils]: 14: Hoare triple {867#(and (= 2 main_~i~0) (<= 2 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {871#(and (< 2 (* 2 main_~k~0)) (<= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:49,014 INFO L280 TraceCheckUtils]: 15: Hoare triple {871#(and (< 2 (* 2 main_~k~0)) (<= main_~i~0 3) (<= 2 main_~n~0) (<= main_~n~0 2))} assume !(~i~0 < 2 * ~k~0); {810#false} is VALID [2020-07-08 12:47:49,014 INFO L263 TraceCheckUtils]: 16: Hoare triple {810#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {810#false} is VALID [2020-07-08 12:47:49,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2020-07-08 12:47:49,014 INFO L280 TraceCheckUtils]: 18: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2020-07-08 12:47:49,014 INFO L280 TraceCheckUtils]: 19: Hoare triple {810#false} assume !false; {810#false} is VALID [2020-07-08 12:47:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:49,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:49,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2020-07-08 12:47:49,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682037403] [2020-07-08 12:47:49,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-07-08 12:47:49,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:49,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 12:47:49,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:49,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 12:47:49,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 12:47:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:47:49,075 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 16 states. [2020-07-08 12:47:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:49,997 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-07-08 12:47:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 12:47:49,998 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-07-08 12:47:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:47:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2020-07-08 12:47:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:47:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2020-07-08 12:47:50,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2020-07-08 12:47:50,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:50,087 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:47:50,087 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 12:47:50,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2020-07-08 12:47:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 12:47:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-08 12:47:50,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:50,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-08 12:47:50,119 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-08 12:47:50,119 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-08 12:47:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:50,123 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 12:47:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 12:47:50,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:50,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:50,124 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-08 12:47:50,124 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-08 12:47:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:50,126 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 12:47:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 12:47:50,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:50,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:50,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:50,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:47:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2020-07-08 12:47:50,130 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2020-07-08 12:47:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:50,131 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2020-07-08 12:47:50,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 12:47:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-08 12:47:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:47:50,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:50,132 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:50,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:50,347 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash -490417350, now seen corresponding path program 3 times [2020-07-08 12:47:50,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:50,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810121482] [2020-07-08 12:47:50,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:50,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {1064#true} assume true; {1064#true} is VALID [2020-07-08 12:47:50,923 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1064#true} {1064#true} #50#return; {1064#true} is VALID [2020-07-08 12:47:50,923 INFO L263 TraceCheckUtils]: 0: Hoare triple {1064#true} call ULTIMATE.init(); {1064#true} is VALID [2020-07-08 12:47:50,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {1064#true} assume true; {1064#true} is VALID [2020-07-08 12:47:50,923 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1064#true} {1064#true} #50#return; {1064#true} is VALID [2020-07-08 12:47:50,924 INFO L263 TraceCheckUtils]: 3: Hoare triple {1064#true} call #t~ret3 := main(); {1064#true} is VALID [2020-07-08 12:47:50,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {1064#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {1068#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:50,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {1068#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1070#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {1070#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1070#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,931 INFO L280 TraceCheckUtils]: 14: Hoare triple {1070#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,932 INFO L280 TraceCheckUtils]: 15: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,932 INFO L280 TraceCheckUtils]: 16: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 12:47:50,933 INFO L280 TraceCheckUtils]: 17: Hoare triple {1071#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,933 INFO L280 TraceCheckUtils]: 18: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 12:47:50,935 INFO L280 TraceCheckUtils]: 19: Hoare triple {1069#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1072#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 12:47:50,939 INFO L280 TraceCheckUtils]: 20: Hoare triple {1072#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1073#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 12:47:50,940 INFO L280 TraceCheckUtils]: 21: Hoare triple {1073#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} assume !!(~i~0 < 2 * ~k~0); {1074#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:50,940 INFO L280 TraceCheckUtils]: 22: Hoare triple {1074#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1074#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:50,941 INFO L280 TraceCheckUtils]: 23: Hoare triple {1074#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1075#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:50,942 INFO L280 TraceCheckUtils]: 24: Hoare triple {1075#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1076#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 12:47:50,943 INFO L263 TraceCheckUtils]: 25: Hoare triple {1076#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1077#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:47:50,945 INFO L280 TraceCheckUtils]: 26: Hoare triple {1077#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1078#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:47:50,946 INFO L280 TraceCheckUtils]: 27: Hoare triple {1078#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1065#false} is VALID [2020-07-08 12:47:50,947 INFO L280 TraceCheckUtils]: 28: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2020-07-08 12:47:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 12:47:50,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810121482] [2020-07-08 12:47:50,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132438957] [2020-07-08 12:47:50,950 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:50,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-08 12:47:50,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:50,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-08 12:47:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:50,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:51,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:51,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:51,564 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:47:51,573 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-08 12:47:51,654 INFO L263 TraceCheckUtils]: 0: Hoare triple {1064#true} call ULTIMATE.init(); {1064#true} is VALID [2020-07-08 12:47:51,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {1064#true} assume true; {1064#true} is VALID [2020-07-08 12:47:51,655 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1064#true} {1064#true} #50#return; {1064#true} is VALID [2020-07-08 12:47:51,655 INFO L263 TraceCheckUtils]: 3: Hoare triple {1064#true} call #t~ret3 := main(); {1064#true} is VALID [2020-07-08 12:47:51,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {1064#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {1068#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 12:47:51,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {1068#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {1097#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:51,662 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1097#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-08 12:47:51,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1104#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {1104#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {1108#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1118#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {1118#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {1118#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:47:51,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {1118#(and (= 2 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1125#(and (= 2 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:51,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {1125#(and (= 2 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:51,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} assume !!(~i~0 < 2 * ~k~0); {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:51,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} is VALID [2020-07-08 12:47:51,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {1129#(and (= 3 main_~i~0) (<= 2 main_~n~0) (<= main_~n~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1139#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= 4 main_~i~0))} is VALID [2020-07-08 12:47:51,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {1139#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= 4 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1139#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= 4 main_~i~0))} is VALID [2020-07-08 12:47:51,672 INFO L280 TraceCheckUtils]: 19: Hoare triple {1139#(and (<= 2 main_~n~0) (<= main_~n~0 2) (= 4 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {1146#(and (<= main_~n~0 3) (<= 3 main_~n~0) (= 4 main_~i~0))} is VALID [2020-07-08 12:47:51,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {1146#(and (<= main_~n~0 3) (<= 3 main_~n~0) (= 4 main_~i~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1150#(and (= 5 main_~i~0) (<= main_~n~0 3) (<= 3 main_~n~0))} is VALID [2020-07-08 12:47:51,674 INFO L280 TraceCheckUtils]: 21: Hoare triple {1150#(and (= 5 main_~i~0) (<= main_~n~0 3) (<= 3 main_~n~0))} assume !!(~i~0 < 2 * ~k~0); {1154#(and (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (<= 3 main_~n~0))} is VALID [2020-07-08 12:47:51,675 INFO L280 TraceCheckUtils]: 22: Hoare triple {1154#(and (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (<= 3 main_~n~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1154#(and (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (<= 3 main_~n~0))} is VALID [2020-07-08 12:47:51,677 INFO L280 TraceCheckUtils]: 23: Hoare triple {1154#(and (= 5 main_~i~0) (<= main_~n~0 3) (< main_~i~0 (* 2 main_~k~0)) (<= 3 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1161#(and (< 5 (* 2 main_~k~0)) (<= main_~n~0 3) (<= 3 main_~n~0) (<= main_~i~0 6))} is VALID [2020-07-08 12:47:51,678 INFO L280 TraceCheckUtils]: 24: Hoare triple {1161#(and (< 5 (* 2 main_~k~0)) (<= main_~n~0 3) (<= 3 main_~n~0) (<= main_~i~0 6))} assume !(~i~0 < 2 * ~k~0); {1165#(and (< 5 (* 2 main_~k~0)) (<= (* 2 main_~k~0) 6) (<= main_~n~0 3) (<= 3 main_~n~0))} is VALID [2020-07-08 12:47:51,679 INFO L263 TraceCheckUtils]: 25: Hoare triple {1165#(and (< 5 (* 2 main_~k~0)) (<= (* 2 main_~k~0) 6) (<= main_~n~0 3) (<= 3 main_~n~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1169#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:51,680 INFO L280 TraceCheckUtils]: 26: Hoare triple {1169#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1173#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:51,680 INFO L280 TraceCheckUtils]: 27: Hoare triple {1173#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1065#false} is VALID [2020-07-08 12:47:51,680 INFO L280 TraceCheckUtils]: 28: Hoare triple {1065#false} assume !false; {1065#false} is VALID [2020-07-08 12:47:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:51,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:51,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2020-07-08 12:47:51,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417736691] [2020-07-08 12:47:51,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2020-07-08 12:47:51,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:51,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-08 12:47:51,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:51,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-08 12:47:51,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:51,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-08 12:47:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2020-07-08 12:47:51,755 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2020-07-08 12:47:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:53,645 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-08 12:47:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 12:47:53,645 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2020-07-08 12:47:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:47:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-07-08 12:47:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:47:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-07-08 12:47:53,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 39 transitions. [2020-07-08 12:47:53,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:53,724 INFO L225 Difference]: With dead ends: 38 [2020-07-08 12:47:53,724 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:47:53,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2020-07-08 12:47:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:47:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:47:53,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:53,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:53,726 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:53,727 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:53,727 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:53,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:53,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:53,727 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:53,727 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:53,728 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:53,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:53,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:53,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:53,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:47:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:47:53,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-08 12:47:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:53,729 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:47:53,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-08 12:47:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:53,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:53,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:47:53,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:47:54,122 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:47:54,123 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:54,123 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 25) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse2 (<= main_~n~0 main_~k~0))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2)) (and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0)) (and (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) .cse2))) [2020-07-08 12:47:54,124 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 22) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))) [2020-07-08 12:47:54,124 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 25) no Hoare annotation was computed. [2020-07-08 12:47:54,124 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:47:54,125 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:54,125 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:47:54,125 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:47:54,125 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:54,125 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:54,129 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:47:54,130 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:47:54,132 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-08 12:47:54,132 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:47:54,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:47:54 BoogieIcfgContainer [2020-07-08 12:47:54,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:47:54,149 INFO L168 Benchmark]: Toolchain (without parser) took 12708.23 ms. Allocated memory was 136.3 MB in the beginning and 314.6 MB in the end (delta: 178.3 MB). Free memory was 101.2 MB in the beginning and 152.0 MB in the end (delta: -50.9 MB). Peak memory consumption was 127.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,150 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.96 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,152 INFO L168 Benchmark]: Boogie Preprocessor took 135.46 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 181.0 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,153 INFO L168 Benchmark]: RCFGBuilder took 473.64 ms. Allocated memory is still 200.8 MB. Free memory was 181.0 MB in the beginning and 162.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,154 INFO L168 Benchmark]: TraceAbstraction took 11789.64 ms. Allocated memory was 200.8 MB in the beginning and 314.6 MB in the end (delta: 113.8 MB). Free memory was 162.2 MB in the beginning and 152.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 124.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:54,158 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.48 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.96 ms. Allocated memory is still 136.3 MB. Free memory was 100.9 MB in the beginning and 91.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.46 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 91.2 MB in the beginning and 181.0 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 473.64 ms. Allocated memory is still 200.8 MB. Free memory was 181.0 MB in the beginning and 162.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11789.64 ms. Allocated memory was 200.8 MB in the beginning and 314.6 MB in the end (delta: 113.8 MB). Free memory was 162.2 MB in the beginning and 152.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 124.0 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: 18]: Loop Invariant Derived loop invariant: (((2 * n <= i + 1 && i + 1 <= 2 * n) && n <= k) || ((0 <= n && n <= 0) && 0 == i)) || ((i <= 2 * n && 2 * n <= i) && n <= k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.4s, OverallIterations: 7, TraceHistogramMax: 6, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 73 SDslu, 350 SDs, 0 SdLazy, 812 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 85 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 30 NumberOfFragments, 59 HoareAnnotationTreeSize, 16 FomulaSimplifications, 151 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 154 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 28322 SizeOfPredicates, 11 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 17/148 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...