/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:39:38,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:39:38,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:39:38,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:39:38,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:39:38,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:39:38,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:39:38,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:39:38,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:39:38,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:39:38,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:39:38,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:39:38,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:39:38,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:39:38,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:39:38,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:39:38,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:39:38,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:39:38,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:39:38,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:39:38,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:39:38,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:39:38,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:39:38,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:39:38,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:39:38,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:39:38,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:39:38,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:39:38,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:39:38,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:39:38,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:39:38,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:39:38,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:39:38,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:39:38,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:39:38,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:39:38,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:39:38,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:39:38,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:39:38,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:39:38,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:39:38,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:39:38,601 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:39:38,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:39:38,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:39:38,603 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:39:38,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:39:38,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:39:38,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:39:38,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:39:38,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:39:38,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:39:38,605 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:39:38,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:39:38,606 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:39:38,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:39:38,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:39:38,607 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:39:38,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:39:38,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:39:38,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:39:38,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:39:38,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:39:38,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:39:38,608 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:39:38,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:39:38,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:39:38,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:39:38,928 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:39:38,928 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:39:38,930 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-08 17:39:39,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd02b73ee/99c81f6edf03466895793ee89ea60b90/FLAG4c8e67f90 [2020-07-08 17:39:39,494 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:39:39,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-08 17:39:39,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd02b73ee/99c81f6edf03466895793ee89ea60b90/FLAG4c8e67f90 [2020-07-08 17:39:39,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd02b73ee/99c81f6edf03466895793ee89ea60b90 [2020-07-08 17:39:39,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:39:39,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:39:39,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:39,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:39:39,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:39:39,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:39" (1/1) ... [2020-07-08 17:39:39,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5161119d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:39, skipping insertion in model container [2020-07-08 17:39:39,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:39" (1/1) ... [2020-07-08 17:39:39,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:39:39,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:39:40,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:40,071 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:39:40,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:40,105 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:39:40,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40 WrapperNode [2020-07-08 17:39:40,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:40,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:39:40,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:39:40,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:39:40,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (1/1) ... [2020-07-08 17:39:40,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:39:40,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:39:40,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:39:40,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:39:40,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (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 17:39:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:39:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:39:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:39:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:39:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:39:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:39:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:39:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:39:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:39:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:39:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:39:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:39:40,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:39:40,627 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:39:40,627 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 17:39:40,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:40 BoogieIcfgContainer [2020-07-08 17:39:40,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:39:40,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:39:40,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:39:40,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:39:40,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:39:39" (1/3) ... [2020-07-08 17:39:40,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44462766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:40, skipping insertion in model container [2020-07-08 17:39:40,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:40" (2/3) ... [2020-07-08 17:39:40,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44462766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:40, skipping insertion in model container [2020-07-08 17:39:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:40" (3/3) ... [2020-07-08 17:39:40,639 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-08 17:39:40,650 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:39:40,657 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:39:40,671 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:39:40,694 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:39:40,694 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:39:40,694 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:39:40,694 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:39:40,695 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:39:40,695 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:39:40,695 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:39:40,695 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:39:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-08 17:39:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 17:39:40,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:40,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:40,722 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1930258608, now seen corresponding path program 1 times [2020-07-08 17:39:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:40,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575360229] [2020-07-08 17:39:40,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:40,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 17:39:40,895 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-08 17:39:40,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-08 17:39:40,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-08 17:39:40,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-08 17:39:40,898 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret0 := main(); {32#true} is VALID [2020-07-08 17:39:40,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0; {32#true} is VALID [2020-07-08 17:39:40,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~j~0; {32#true} is VALID [2020-07-08 17:39:40,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~k~0; {32#true} is VALID [2020-07-08 17:39:40,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i~0 := 0; {32#true} is VALID [2020-07-08 17:39:40,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~k~0 := 9; {32#true} is VALID [2020-07-08 17:39:40,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} ~j~0 := -100; {32#true} is VALID [2020-07-08 17:39:40,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-08 17:39:40,912 INFO L263 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {33#false} is VALID [2020-07-08 17:39:40,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-08 17:39:40,913 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-08 17:39:40,914 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-08 17:39:40,915 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 17:39:40,916 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:40,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575360229] [2020-07-08 17:39:40,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:40,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 17:39:40,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637029449] [2020-07-08 17:39:40,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-08 17:39:40,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:40,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 17:39:41,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:41,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 17:39:41,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 17:39:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:39:41,012 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-08 17:39:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,130 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-08 17:39:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 17:39:41,130 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-08 17:39:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:39:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-08 17:39:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:39:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-08 17:39:41,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-08 17:39:41,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:41,307 INFO L225 Difference]: With dead ends: 48 [2020-07-08 17:39:41,307 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 17:39:41,311 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 17:39:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 17:39:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 17:39:41,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:41,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 17:39:41,362 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 17:39:41,362 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 17:39:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,366 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-08 17:39:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-08 17:39:41,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,368 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 17:39:41,368 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 17:39:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,372 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-08 17:39:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-08 17:39:41,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:41,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 17:39:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-08 17:39:41,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-08 17:39:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:41,379 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-08 17:39:41,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 17:39:41,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2020-07-08 17:39:41,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-08 17:39:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 17:39:41,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:41,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:41,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:39:41,415 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:41,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1900705936, now seen corresponding path program 1 times [2020-07-08 17:39:41,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:41,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333223563] [2020-07-08 17:39:41,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:41,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-08 17:39:41,479 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-08 17:39:41,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2020-07-08 17:39:41,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-08 17:39:41,481 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-08 17:39:41,481 INFO L263 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2020-07-08 17:39:41,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0; {222#true} is VALID [2020-07-08 17:39:41,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {222#true} havoc ~j~0; {222#true} is VALID [2020-07-08 17:39:41,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#true} havoc ~k~0; {222#true} is VALID [2020-07-08 17:39:41,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#true} ~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:41,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 0)} ~k~0 := 9; {226#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:41,488 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~i~0 0)} ~j~0 := -100; {226#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:41,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~i~0 0)} assume !(~i~0 <= 100); {223#false} is VALID [2020-07-08 17:39:41,490 INFO L263 TraceCheckUtils]: 11: Hoare triple {223#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {223#false} is VALID [2020-07-08 17:39:41,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2020-07-08 17:39:41,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2020-07-08 17:39:41,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {223#false} assume !false; {223#false} is VALID [2020-07-08 17:39:41,493 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 17:39:41,494 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:41,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333223563] [2020-07-08 17:39:41,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:41,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:39:41,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672909621] [2020-07-08 17:39:41,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-08 17:39:41,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:41,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:39:41,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:41,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:39:41,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:39:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:39:41,521 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-08 17:39:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,590 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-08 17:39:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:39:41,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-08 17:39:41,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:39:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-08 17:39:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:39:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-08 17:39:41,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2020-07-08 17:39:41,646 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 17:39:41,648 INFO L225 Difference]: With dead ends: 29 [2020-07-08 17:39:41,648 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 17:39:41,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:39:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 17:39:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-08 17:39:41,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:41,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-08 17:39:41,674 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-08 17:39:41,675 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-08 17:39:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,677 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-08 17:39:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 17:39:41,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,679 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-08 17:39:41,679 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-08 17:39:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:41,681 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-08 17:39:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-08 17:39:41,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:41,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:41,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:41,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 17:39:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-08 17:39:41,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-08 17:39:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:41,685 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-08 17:39:41,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:39:41,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2020-07-08 17:39:41,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 17:39:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 17:39:41,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:41,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:41,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:39:41,718 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1024587775, now seen corresponding path program 1 times [2020-07-08 17:39:41,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:41,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764515090] [2020-07-08 17:39:41,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-08 17:39:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:44,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-08 17:39:44,007 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-08 17:39:44,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-08 17:39:44,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-08 17:39:44,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-08 17:39:44,009 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret0 := main(); {381#true} is VALID [2020-07-08 17:39:44,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0; {381#true} is VALID [2020-07-08 17:39:44,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#true} havoc ~j~0; {381#true} is VALID [2020-07-08 17:39:44,010 INFO L280 TraceCheckUtils]: 6: Hoare triple {381#true} havoc ~k~0; {381#true} is VALID [2020-07-08 17:39:44,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {381#true} ~i~0 := 0; {381#true} is VALID [2020-07-08 17:39:44,010 INFO L280 TraceCheckUtils]: 8: Hoare triple {381#true} ~k~0 := 9; {381#true} is VALID [2020-07-08 17:39:44,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#true} ~j~0 := -100; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 17:39:44,014 INFO L280 TraceCheckUtils]: 10: Hoare triple {385#(<= (+ main_~j~0 100) 0)} [80] L24-3-->L18-2_primed: Formula: (let ((.cse7 (* 2 v_oct_main_~k~0_out_1))) (let ((.cse0 (<= v_oct_main_~j~0_out_1 v_oct_main_~j~0_in_1)) (.cse5 (+ v_oct_main_~i~0_in_1 2)) (.cse2 (<= 8 .cse7)) (.cse3 (<= v_oct_main_~j~0_in_1 v_oct_main_~j~0_out_1)) (.cse4 (<= .cse7 8)) (.cse6 (<= 40 (* 2 v_oct_main_~j~0_in_1)))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_1 1))) (and .cse0 (<= .cse1 v_oct_main_~i~0_out_1) (<= (* 2 v_oct_main_~i~0_in_1) 200) .cse2 (<= v_oct_main_~i~0_out_1 .cse1) .cse3 (or (not .cse0) (< 101 v_oct_main_~i~0_out_1) (< 102 v_oct_main_~i~0_out_1) (not .cse4) (< 99 v_oct_main_~i~0_in_1) (< v_oct_main_~i~0_out_1 .cse5) (not .cse2) (< 100 v_oct_main_~i~0_in_1) (not .cse3) (not .cse6)) .cse4 .cse6)) (and .cse0 (<= v_oct_main_~i~0_out_1 101) (<= v_oct_main_~i~0_in_1 100) (<= .cse5 v_oct_main_~i~0_out_1) .cse2 .cse3 (<= v_oct_main_~i~0_out_1 102) (<= v_oct_main_~i~0_in_1 99) .cse4 .cse6)))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~j~0=v_oct_main_~j~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~k~0=v_oct_main_~k~0_out_1, main_~j~0=v_oct_main_~j~0_out_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {382#false} is VALID [2020-07-08 17:39:44,014 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#false} [79] L18-2_primed-->L18-2: Formula: (not (<= v_main_~i~0_4 100)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {382#false} is VALID [2020-07-08 17:39:44,015 INFO L263 TraceCheckUtils]: 12: Hoare triple {382#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {382#false} is VALID [2020-07-08 17:39:44,015 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-08 17:39:44,015 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-08 17:39:44,016 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-08 17:39:44,016 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 17:39:44,054 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:44,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764515090] [2020-07-08 17:39:44,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:44,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:39:44,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745926541] [2020-07-08 17:39:44,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 17:39:44,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:44,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:39:44,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:44,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:39:44,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:44,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:39:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:44,083 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2020-07-08 17:39:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,182 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-08 17:39:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 17:39:44,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-08 17:39:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 17:39:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-08 17:39:44,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-08 17:39:44,238 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 17:39:44,240 INFO L225 Difference]: With dead ends: 38 [2020-07-08 17:39:44,241 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 17:39:44,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 17:39:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-08 17:39:44,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:44,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-08 17:39:44,269 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-08 17:39:44,269 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-08 17:39:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,272 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 17:39:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 17:39:44,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,273 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-08 17:39:44,273 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-08 17:39:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,275 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 17:39:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 17:39:44,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:44,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 17:39:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 17:39:44,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-08 17:39:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:44,279 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 17:39:44,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:39:44,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-08 17:39:44,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 17:39:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 17:39:44,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:44,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:44,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:39:44,314 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2065885280, now seen corresponding path program 1 times [2020-07-08 17:39:44,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:44,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911829951] [2020-07-08 17:39:44,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:44,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-08 17:39:44,394 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-08 17:39:44,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2020-07-08 17:39:44,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-08 17:39:44,395 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-08 17:39:44,396 INFO L263 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret0 := main(); {568#true} is VALID [2020-07-08 17:39:44,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {568#true} havoc ~i~0; {568#true} is VALID [2020-07-08 17:39:44,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~j~0; {568#true} is VALID [2020-07-08 17:39:44,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {568#true} havoc ~k~0; {568#true} is VALID [2020-07-08 17:39:44,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {568#true} ~i~0 := 0; {572#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:44,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {572#(<= main_~i~0 0)} ~k~0 := 9; {572#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:44,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {572#(<= main_~i~0 0)} ~j~0 := -100; {572#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:44,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {572#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {572#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:44,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {572#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#(<= main_~i~0 1)} assume !!(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {573#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#(<= main_~i~0 1)} assume !(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {573#(<= main_~i~0 1)} ~k~0 := 4; {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#(<= main_~i~0 1)} assume !(~k~0 <= 3); {573#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:44,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {573#(<= main_~i~0 1)} assume !(~i~0 <= 100); {569#false} is VALID [2020-07-08 17:39:44,408 INFO L263 TraceCheckUtils]: 18: Hoare triple {569#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {569#false} is VALID [2020-07-08 17:39:44,409 INFO L280 TraceCheckUtils]: 19: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2020-07-08 17:39:44,409 INFO L280 TraceCheckUtils]: 20: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2020-07-08 17:39:44,410 INFO L280 TraceCheckUtils]: 21: Hoare triple {569#false} assume !false; {569#false} is VALID [2020-07-08 17:39:44,411 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 17:39:44,412 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:44,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911829951] [2020-07-08 17:39:44,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:44,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:39:44,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263756917] [2020-07-08 17:39:44,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-08 17:39:44,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:44,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:39:44,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:44,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:39:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:39:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:39:44,444 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-08 17:39:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,556 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-08 17:39:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:39:44,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-08 17:39:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:39:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-08 17:39:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:39:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-08 17:39:44,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-08 17:39:44,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:44,608 INFO L225 Difference]: With dead ends: 37 [2020-07-08 17:39:44,609 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 17:39:44,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:39:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 17:39:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-08 17:39:44,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:44,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-08 17:39:44,655 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-08 17:39:44,655 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-08 17:39:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,658 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 17:39:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 17:39:44,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,659 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-08 17:39:44,659 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-08 17:39:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:44,662 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-08 17:39:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-08 17:39:44,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:44,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:44,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:44,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 17:39:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-08 17:39:44,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-08 17:39:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:44,666 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-08 17:39:44,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:39:44,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-08 17:39:44,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-08 17:39:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 17:39:44,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:44,711 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:44,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:39:44,712 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1729554991, now seen corresponding path program 2 times [2020-07-08 17:39:44,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:44,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057738982] [2020-07-08 17:39:44,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-08 17:39:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:46,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-08 17:39:46,987 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-08 17:39:46,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2020-07-08 17:39:46,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-08 17:39:46,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-08 17:39:46,988 INFO L263 TraceCheckUtils]: 3: Hoare triple {776#true} call #t~ret0 := main(); {776#true} is VALID [2020-07-08 17:39:46,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} havoc ~i~0; {776#true} is VALID [2020-07-08 17:39:46,989 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} havoc ~j~0; {776#true} is VALID [2020-07-08 17:39:46,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#true} havoc ~k~0; {776#true} is VALID [2020-07-08 17:39:46,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} ~i~0 := 0; {776#true} is VALID [2020-07-08 17:39:46,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} ~k~0 := 9; {776#true} is VALID [2020-07-08 17:39:46,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} ~j~0 := -100; {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 17:39:46,992 INFO L280 TraceCheckUtils]: 10: Hoare triple {780#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 17:39:46,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {780#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 17:39:46,993 INFO L280 TraceCheckUtils]: 12: Hoare triple {780#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20); {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 17:39:46,994 INFO L280 TraceCheckUtils]: 13: Hoare triple {780#(<= (+ main_~j~0 100) 0)} ~j~0 := ~i~0 + ~j~0; {781#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2020-07-08 17:39:46,995 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {782#(<= 120 main_~i~0)} is VALID [2020-07-08 17:39:46,996 INFO L280 TraceCheckUtils]: 15: Hoare triple {782#(<= 120 main_~i~0)} ~k~0 := 4; {782#(<= 120 main_~i~0)} is VALID [2020-07-08 17:39:46,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {782#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {782#(<= 120 main_~i~0)} is VALID [2020-07-08 17:39:46,998 INFO L280 TraceCheckUtils]: 17: Hoare triple {782#(<= 120 main_~i~0)} assume !!(~i~0 <= 100); {777#false} is VALID [2020-07-08 17:39:46,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {777#false} ~i~0 := 1 + ~i~0; {777#false} is VALID [2020-07-08 17:39:46,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {777#false} assume !(~j~0 < 20); {777#false} is VALID [2020-07-08 17:39:46,999 INFO L280 TraceCheckUtils]: 20: Hoare triple {777#false} ~k~0 := 4; {777#false} is VALID [2020-07-08 17:39:46,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {777#false} assume !(~k~0 <= 3); {777#false} is VALID [2020-07-08 17:39:46,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {777#false} assume !(~i~0 <= 100); {777#false} is VALID [2020-07-08 17:39:46,999 INFO L263 TraceCheckUtils]: 23: Hoare triple {777#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {777#false} is VALID [2020-07-08 17:39:47,000 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2020-07-08 17:39:47,000 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2020-07-08 17:39:47,000 INFO L280 TraceCheckUtils]: 26: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-08 17:39:47,002 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 17:39:47,002 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:47,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057738982] [2020-07-08 17:39:47,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:47,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:39:47,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266964707] [2020-07-08 17:39:47,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 17:39:47,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:47,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:39:47,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:47,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:39:47,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:47,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:39:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:47,033 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-08 17:39:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:47,191 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-08 17:39:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 17:39:47,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 17:39:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 17:39:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 17:39:47,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-08 17:39:47,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:47,249 INFO L225 Difference]: With dead ends: 50 [2020-07-08 17:39:47,250 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 17:39:47,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:39:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 17:39:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-08 17:39:47,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:47,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-08 17:39:47,285 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-08 17:39:47,286 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-08 17:39:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:47,287 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 17:39:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 17:39:47,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:47,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:47,288 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-08 17:39:47,289 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-08 17:39:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:47,291 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 17:39:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-08 17:39:47,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:47,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:47,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:47,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 17:39:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-08 17:39:47,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-08 17:39:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:47,294 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-08 17:39:47,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:39:47,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-08 17:39:47,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 17:39:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 17:39:47,334 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:47,335 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:47,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:39:47,335 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:47,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:47,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1385563474, now seen corresponding path program 3 times [2020-07-08 17:39:47,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:47,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321971357] [2020-07-08 17:39:47,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 [2020-07-08 17:39:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:49,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-08 17:39:49,617 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-08 17:39:49,617 INFO L263 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2020-07-08 17:39:49,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-08 17:39:49,618 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-08 17:39:49,618 INFO L263 TraceCheckUtils]: 3: Hoare triple {1021#true} call #t~ret0 := main(); {1021#true} is VALID [2020-07-08 17:39:49,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {1021#true} havoc ~i~0; {1021#true} is VALID [2020-07-08 17:39:49,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~j~0; {1021#true} is VALID [2020-07-08 17:39:49,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {1021#true} havoc ~k~0; {1021#true} is VALID [2020-07-08 17:39:49,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#true} ~i~0 := 0; {1025#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:49,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {1025#(<= main_~i~0 0)} ~k~0 := 9; {1025#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:49,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(<= main_~i~0 0)} ~j~0 := -100; {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:49,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:49,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-08 17:39:49,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20); {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-08 17:39:49,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-08 17:39:49,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20); {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-08 17:39:49,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1029#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-08 17:39:49,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-08 17:39:49,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-08 17:39:49,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-08 17:39:49,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {1022#false} assume !!(~i~0 <= 100); {1022#false} is VALID [2020-07-08 17:39:49,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {1022#false} ~i~0 := 1 + ~i~0; {1022#false} is VALID [2020-07-08 17:39:49,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {1022#false} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-08 17:39:49,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-08 17:39:49,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-08 17:39:49,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {1022#false} assume !(~i~0 <= 100); {1022#false} is VALID [2020-07-08 17:39:49,633 INFO L263 TraceCheckUtils]: 25: Hoare triple {1022#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1022#false} is VALID [2020-07-08 17:39:49,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2020-07-08 17:39:49,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2020-07-08 17:39:49,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2020-07-08 17:39:49,635 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 17:39:49,636 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:49,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321971357] [2020-07-08 17:39:49,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:49,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 17:39:49,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66906322] [2020-07-08 17:39:49,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-08 17:39:49,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:49,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 17:39:49,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:49,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 17:39:49,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 17:39:49,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-08 17:39:49,668 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-08 17:39:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:49,942 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-08 17:39:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:39:49,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-08 17:39:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:39:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 17:39:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 17:39:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 17:39:49,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-08 17:39:50,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:50,002 INFO L225 Difference]: With dead ends: 52 [2020-07-08 17:39:50,002 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 17:39:50,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:39:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 17:39:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-08 17:39:50,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:50,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-08 17:39:50,041 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-08 17:39:50,041 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-08 17:39:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,043 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-08 17:39:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-08 17:39:50,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,044 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-08 17:39:50,045 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-08 17:39:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,048 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-08 17:39:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-08 17:39:50,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:50,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 17:39:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-08 17:39:50,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2020-07-08 17:39:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:50,052 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-08 17:39:50,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 17:39:50,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-08 17:39:50,099 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 17:39:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 17:39:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 17:39:50,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:50,101 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:50,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:39:50,102 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1422203027, now seen corresponding path program 4 times [2020-07-08 17:39:50,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:50,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487093054] [2020-07-08 17:39:50,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:50,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-08 17:39:50,233 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-08 17:39:50,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2020-07-08 17:39:50,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-08 17:39:50,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-08 17:39:50,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {1284#true} call #t~ret0 := main(); {1284#true} is VALID [2020-07-08 17:39:50,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} havoc ~i~0; {1284#true} is VALID [2020-07-08 17:39:50,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~j~0; {1284#true} is VALID [2020-07-08 17:39:50,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {1284#true} havoc ~k~0; {1284#true} is VALID [2020-07-08 17:39:50,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~i~0 := 0; {1288#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:50,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {1288#(<= main_~i~0 0)} ~k~0 := 9; {1288#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:50,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {1288#(<= main_~i~0 0)} ~j~0 := -100; {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:50,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:50,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,241 INFO L280 TraceCheckUtils]: 13: Hoare triple {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,243 INFO L280 TraceCheckUtils]: 16: Hoare triple {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20); {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,244 INFO L280 TraceCheckUtils]: 17: Hoare triple {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1293#(<= (+ main_~j~0 97) 0)} is VALID [2020-07-08 17:39:50,245 INFO L280 TraceCheckUtils]: 18: Hoare triple {1293#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-08 17:39:50,246 INFO L280 TraceCheckUtils]: 19: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-08 17:39:50,246 INFO L280 TraceCheckUtils]: 20: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-08 17:39:50,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {1285#false} assume !!(~i~0 <= 100); {1285#false} is VALID [2020-07-08 17:39:50,246 INFO L280 TraceCheckUtils]: 22: Hoare triple {1285#false} ~i~0 := 1 + ~i~0; {1285#false} is VALID [2020-07-08 17:39:50,247 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-08 17:39:50,247 INFO L280 TraceCheckUtils]: 24: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-08 17:39:50,247 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-08 17:39:50,247 INFO L280 TraceCheckUtils]: 26: Hoare triple {1285#false} assume !(~i~0 <= 100); {1285#false} is VALID [2020-07-08 17:39:50,248 INFO L263 TraceCheckUtils]: 27: Hoare triple {1285#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1285#false} is VALID [2020-07-08 17:39:50,248 INFO L280 TraceCheckUtils]: 28: Hoare triple {1285#false} ~cond := #in~cond; {1285#false} is VALID [2020-07-08 17:39:50,248 INFO L280 TraceCheckUtils]: 29: Hoare triple {1285#false} assume 0 == ~cond; {1285#false} is VALID [2020-07-08 17:39:50,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-08 17:39:50,250 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 17:39:50,251 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:50,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487093054] [2020-07-08 17:39:50,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:50,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:39:50,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40482422] [2020-07-08 17:39:50,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-08 17:39:50,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:50,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:39:50,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:50,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:39:50,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:39:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:39:50,284 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-07-08 17:39:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,607 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-08 17:39:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 17:39:50,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-08 17:39:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:39:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-08 17:39:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:39:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-08 17:39:50,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-08 17:39:50,660 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 17:39:50,661 INFO L225 Difference]: With dead ends: 54 [2020-07-08 17:39:50,662 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 17:39:50,662 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:39:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 17:39:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-08 17:39:50,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:50,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-08 17:39:50,712 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-08 17:39:50,712 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-08 17:39:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,714 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-08 17:39:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 17:39:50,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,715 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-08 17:39:50,715 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-08 17:39:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:50,717 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-08 17:39:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 17:39:50,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:50,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:50,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:50,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 17:39:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-08 17:39:50,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2020-07-08 17:39:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:50,720 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-08 17:39:50,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:39:50,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-08 17:39:50,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-08 17:39:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 17:39:50,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:50,767 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:50,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 17:39:50,767 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892204, now seen corresponding path program 5 times [2020-07-08 17:39:50,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:50,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573981010] [2020-07-08 17:39:50,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 37 to 73 [2020-07-08 17:39:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-08 17:39:53,051 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-08 17:39:53,051 INFO L263 TraceCheckUtils]: 0: Hoare triple {1562#true} call ULTIMATE.init(); {1562#true} is VALID [2020-07-08 17:39:53,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-08 17:39:53,052 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-08 17:39:53,052 INFO L263 TraceCheckUtils]: 3: Hoare triple {1562#true} call #t~ret0 := main(); {1562#true} is VALID [2020-07-08 17:39:53,052 INFO L280 TraceCheckUtils]: 4: Hoare triple {1562#true} havoc ~i~0; {1562#true} is VALID [2020-07-08 17:39:53,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {1562#true} havoc ~j~0; {1562#true} is VALID [2020-07-08 17:39:53,053 INFO L280 TraceCheckUtils]: 6: Hoare triple {1562#true} havoc ~k~0; {1562#true} is VALID [2020-07-08 17:39:53,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {1562#true} ~i~0 := 0; {1566#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:53,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {1566#(<= main_~i~0 0)} ~k~0 := 9; {1566#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:53,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {1566#(<= main_~i~0 0)} ~j~0 := -100; {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:53,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:53,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,059 INFO L280 TraceCheckUtils]: 13: Hoare triple {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,060 INFO L280 TraceCheckUtils]: 14: Hoare triple {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,061 INFO L280 TraceCheckUtils]: 15: Hoare triple {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,061 INFO L280 TraceCheckUtils]: 16: Hoare triple {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,062 INFO L280 TraceCheckUtils]: 17: Hoare triple {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,064 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} assume !!(~j~0 < 20); {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,066 INFO L280 TraceCheckUtils]: 19: Hoare triple {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1572#(<= (+ main_~j~0 96) 0)} is VALID [2020-07-08 17:39:53,067 INFO L280 TraceCheckUtils]: 20: Hoare triple {1572#(<= (+ main_~j~0 96) 0)} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-08 17:39:53,067 INFO L280 TraceCheckUtils]: 21: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-08 17:39:53,067 INFO L280 TraceCheckUtils]: 22: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-08 17:39:53,067 INFO L280 TraceCheckUtils]: 23: Hoare triple {1563#false} assume !!(~i~0 <= 100); {1563#false} is VALID [2020-07-08 17:39:53,068 INFO L280 TraceCheckUtils]: 24: Hoare triple {1563#false} ~i~0 := 1 + ~i~0; {1563#false} is VALID [2020-07-08 17:39:53,068 INFO L280 TraceCheckUtils]: 25: Hoare triple {1563#false} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-08 17:39:53,068 INFO L280 TraceCheckUtils]: 26: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-08 17:39:53,068 INFO L280 TraceCheckUtils]: 27: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-08 17:39:53,069 INFO L280 TraceCheckUtils]: 28: Hoare triple {1563#false} assume !(~i~0 <= 100); {1563#false} is VALID [2020-07-08 17:39:53,069 INFO L263 TraceCheckUtils]: 29: Hoare triple {1563#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1563#false} is VALID [2020-07-08 17:39:53,069 INFO L280 TraceCheckUtils]: 30: Hoare triple {1563#false} ~cond := #in~cond; {1563#false} is VALID [2020-07-08 17:39:53,069 INFO L280 TraceCheckUtils]: 31: Hoare triple {1563#false} assume 0 == ~cond; {1563#false} is VALID [2020-07-08 17:39:53,070 INFO L280 TraceCheckUtils]: 32: Hoare triple {1563#false} assume !false; {1563#false} is VALID [2020-07-08 17:39:53,071 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 17:39:53,072 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:53,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573981010] [2020-07-08 17:39:53,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:53,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:39:53,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553337086] [2020-07-08 17:39:53,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-08 17:39:53,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:53,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:39:53,107 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 17:39:53,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:39:53,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:53,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:39:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:39:53,109 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2020-07-08 17:39:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,508 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-08 17:39:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:39:53,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-08 17:39:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-08 17:39:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-08 17:39:53,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-08 17:39:53,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:53,562 INFO L225 Difference]: With dead ends: 56 [2020-07-08 17:39:53,563 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 17:39:53,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-07-08 17:39:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 17:39:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-08 17:39:53,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:53,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-08 17:39:53,619 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-08 17:39:53,620 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-08 17:39:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,621 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 17:39:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 17:39:53,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:53,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:53,622 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-08 17:39:53,622 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-08 17:39:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,625 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 17:39:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-08 17:39:53,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:53,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:53,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:53,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 17:39:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-08 17:39:53,628 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2020-07-08 17:39:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:53,629 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-08 17:39:53,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:39:53,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2020-07-08 17:39:53,688 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 17:39:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-08 17:39:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 17:39:53,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:53,690 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:53,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 17:39:53,690 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash 377623979, now seen corresponding path program 6 times [2020-07-08 17:39:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:53,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525739179] [2020-07-08 17:39:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-08 17:39:53,851 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-08 17:39:53,851 INFO L263 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2020-07-08 17:39:53,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-08 17:39:53,852 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-08 17:39:53,852 INFO L263 TraceCheckUtils]: 3: Hoare triple {1855#true} call #t~ret0 := main(); {1855#true} is VALID [2020-07-08 17:39:53,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {1855#true} havoc ~i~0; {1855#true} is VALID [2020-07-08 17:39:53,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~j~0; {1855#true} is VALID [2020-07-08 17:39:53,852 INFO L280 TraceCheckUtils]: 6: Hoare triple {1855#true} havoc ~k~0; {1855#true} is VALID [2020-07-08 17:39:53,853 INFO L280 TraceCheckUtils]: 7: Hoare triple {1855#true} ~i~0 := 0; {1859#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:53,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#(<= main_~i~0 0)} ~k~0 := 9; {1859#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:53,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~i~0 0)} ~j~0 := -100; {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:53,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:53,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,856 INFO L280 TraceCheckUtils]: 13: Hoare triple {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,857 INFO L280 TraceCheckUtils]: 14: Hoare triple {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,857 INFO L280 TraceCheckUtils]: 15: Hoare triple {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,859 INFO L280 TraceCheckUtils]: 17: Hoare triple {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,859 INFO L280 TraceCheckUtils]: 18: Hoare triple {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,866 INFO L280 TraceCheckUtils]: 19: Hoare triple {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,866 INFO L280 TraceCheckUtils]: 20: Hoare triple {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} assume !!(~j~0 < 20); {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,867 INFO L280 TraceCheckUtils]: 21: Hoare triple {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1866#(<= (+ main_~j~0 95) 0)} is VALID [2020-07-08 17:39:53,868 INFO L280 TraceCheckUtils]: 22: Hoare triple {1866#(<= (+ main_~j~0 95) 0)} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-08 17:39:53,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-08 17:39:53,868 INFO L280 TraceCheckUtils]: 24: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-08 17:39:53,868 INFO L280 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !!(~i~0 <= 100); {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L280 TraceCheckUtils]: 26: Hoare triple {1856#false} ~i~0 := 1 + ~i~0; {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L280 TraceCheckUtils]: 27: Hoare triple {1856#false} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L280 TraceCheckUtils]: 28: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L280 TraceCheckUtils]: 29: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L280 TraceCheckUtils]: 30: Hoare triple {1856#false} assume !(~i~0 <= 100); {1856#false} is VALID [2020-07-08 17:39:53,869 INFO L263 TraceCheckUtils]: 31: Hoare triple {1856#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1856#false} is VALID [2020-07-08 17:39:53,870 INFO L280 TraceCheckUtils]: 32: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2020-07-08 17:39:53,870 INFO L280 TraceCheckUtils]: 33: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2020-07-08 17:39:53,870 INFO L280 TraceCheckUtils]: 34: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2020-07-08 17:39:53,871 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 17:39:53,871 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:53,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525739179] [2020-07-08 17:39:53,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:53,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 17:39:53,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679050994] [2020-07-08 17:39:53,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-08 17:39:53,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:53,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 17:39:53,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:53,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 17:39:53,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 17:39:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 17:39:53,914 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-07-08 17:39:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,378 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-08 17:39:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:39:54,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-08 17:39:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-08 17:39:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 17:39:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-08 17:39:54,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-08 17:39:54,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:54,451 INFO L225 Difference]: With dead ends: 58 [2020-07-08 17:39:54,451 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 17:39:54,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-07-08 17:39:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 17:39:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-08 17:39:54,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:54,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-08 17:39:54,534 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-08 17:39:54,534 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-08 17:39:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,538 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-08 17:39:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-08 17:39:54,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:54,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:54,538 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-08 17:39:54,539 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-08 17:39:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,540 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-08 17:39:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-08 17:39:54,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:54,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:54,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:54,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 17:39:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-08 17:39:54,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2020-07-08 17:39:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:54,544 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-08 17:39:54,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 17:39:54,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2020-07-08 17:39:54,606 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 17:39:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-08 17:39:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 17:39:54,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:54,608 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:54,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 17:39:54,608 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:54,609 INFO L82 PathProgramCache]: Analyzing trace with hash 783824682, now seen corresponding path program 7 times [2020-07-08 17:39:54,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:54,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394524336] [2020-07-08 17:39:54,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:54,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-08 17:39:54,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-08 17:39:54,781 INFO L263 TraceCheckUtils]: 0: Hoare triple {2163#true} call ULTIMATE.init(); {2163#true} is VALID [2020-07-08 17:39:54,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-08 17:39:54,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-08 17:39:54,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {2163#true} call #t~ret0 := main(); {2163#true} is VALID [2020-07-08 17:39:54,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {2163#true} havoc ~i~0; {2163#true} is VALID [2020-07-08 17:39:54,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {2163#true} havoc ~j~0; {2163#true} is VALID [2020-07-08 17:39:54,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {2163#true} havoc ~k~0; {2163#true} is VALID [2020-07-08 17:39:54,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {2163#true} ~i~0 := 0; {2167#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:54,785 INFO L280 TraceCheckUtils]: 8: Hoare triple {2167#(<= main_~i~0 0)} ~k~0 := 9; {2167#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:54,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {2167#(<= main_~i~0 0)} ~j~0 := -100; {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:54,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:54,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,800 INFO L280 TraceCheckUtils]: 16: Hoare triple {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,807 INFO L280 TraceCheckUtils]: 22: Hoare triple {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} assume !!(~j~0 < 20); {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,808 INFO L280 TraceCheckUtils]: 23: Hoare triple {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2175#(<= (+ main_~j~0 94) 0)} is VALID [2020-07-08 17:39:54,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {2175#(<= (+ main_~j~0 94) 0)} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-08 17:39:54,809 INFO L280 TraceCheckUtils]: 25: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-08 17:39:54,809 INFO L280 TraceCheckUtils]: 26: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-08 17:39:54,810 INFO L280 TraceCheckUtils]: 27: Hoare triple {2164#false} assume !!(~i~0 <= 100); {2164#false} is VALID [2020-07-08 17:39:54,810 INFO L280 TraceCheckUtils]: 28: Hoare triple {2164#false} ~i~0 := 1 + ~i~0; {2164#false} is VALID [2020-07-08 17:39:54,810 INFO L280 TraceCheckUtils]: 29: Hoare triple {2164#false} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-08 17:39:54,810 INFO L280 TraceCheckUtils]: 30: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-08 17:39:54,811 INFO L280 TraceCheckUtils]: 31: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-08 17:39:54,811 INFO L280 TraceCheckUtils]: 32: Hoare triple {2164#false} assume !(~i~0 <= 100); {2164#false} is VALID [2020-07-08 17:39:54,811 INFO L263 TraceCheckUtils]: 33: Hoare triple {2164#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2164#false} is VALID [2020-07-08 17:39:54,811 INFO L280 TraceCheckUtils]: 34: Hoare triple {2164#false} ~cond := #in~cond; {2164#false} is VALID [2020-07-08 17:39:54,812 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#false} assume 0 == ~cond; {2164#false} is VALID [2020-07-08 17:39:54,812 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#false} assume !false; {2164#false} is VALID [2020-07-08 17:39:54,814 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 17:39:54,814 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:54,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394524336] [2020-07-08 17:39:54,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:54,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:39:54,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005733050] [2020-07-08 17:39:54,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 17:39:54,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:54,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:39:54,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:39:54,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:39:54,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:39:54,862 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 11 states. [2020-07-08 17:39:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:55,430 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-08 17:39:55,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 17:39:55,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-08 17:39:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-08 17:39:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-08 17:39:55,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-08 17:39:55,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:55,497 INFO L225 Difference]: With dead ends: 60 [2020-07-08 17:39:55,497 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 17:39:55,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-07-08 17:39:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 17:39:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-08 17:39:55,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:55,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-08 17:39:55,581 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-08 17:39:55,582 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-08 17:39:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:55,583 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 17:39:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 17:39:55,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:55,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:55,583 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-08 17:39:55,583 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-08 17:39:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:55,584 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 17:39:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 17:39:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:55,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:55,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:55,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-08 17:39:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-08 17:39:55,587 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2020-07-08 17:39:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:55,587 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-08 17:39:55,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:39:55,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-08 17:39:55,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-08 17:39:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-08 17:39:55,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:55,645 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:55,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 17:39:55,645 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 300676329, now seen corresponding path program 8 times [2020-07-08 17:39:55,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:55,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335324425] [2020-07-08 17:39:55,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:55,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-08 17:39:55,857 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-08 17:39:55,857 INFO L263 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L263 TraceCheckUtils]: 3: Hoare triple {2486#true} call #t~ret0 := main(); {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L280 TraceCheckUtils]: 4: Hoare triple {2486#true} havoc ~i~0; {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L280 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~j~0; {2486#true} is VALID [2020-07-08 17:39:55,858 INFO L280 TraceCheckUtils]: 6: Hoare triple {2486#true} havoc ~k~0; {2486#true} is VALID [2020-07-08 17:39:55,859 INFO L280 TraceCheckUtils]: 7: Hoare triple {2486#true} ~i~0 := 0; {2490#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:55,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#(<= main_~i~0 0)} ~k~0 := 9; {2490#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:55,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#(<= main_~i~0 0)} ~j~0 := -100; {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:55,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:55,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,862 INFO L280 TraceCheckUtils]: 13: Hoare triple {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,863 INFO L280 TraceCheckUtils]: 14: Hoare triple {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,864 INFO L280 TraceCheckUtils]: 16: Hoare triple {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,865 INFO L280 TraceCheckUtils]: 17: Hoare triple {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,865 INFO L280 TraceCheckUtils]: 18: Hoare triple {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,866 INFO L280 TraceCheckUtils]: 19: Hoare triple {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,866 INFO L280 TraceCheckUtils]: 20: Hoare triple {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,867 INFO L280 TraceCheckUtils]: 21: Hoare triple {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,867 INFO L280 TraceCheckUtils]: 22: Hoare triple {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,868 INFO L280 TraceCheckUtils]: 24: Hoare triple {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} assume !!(~j~0 < 20); {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,869 INFO L280 TraceCheckUtils]: 25: Hoare triple {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2499#(<= (+ main_~j~0 93) 0)} is VALID [2020-07-08 17:39:55,871 INFO L280 TraceCheckUtils]: 26: Hoare triple {2499#(<= (+ main_~j~0 93) 0)} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-08 17:39:55,871 INFO L280 TraceCheckUtils]: 27: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-08 17:39:55,871 INFO L280 TraceCheckUtils]: 28: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-08 17:39:55,871 INFO L280 TraceCheckUtils]: 29: Hoare triple {2487#false} assume !!(~i~0 <= 100); {2487#false} is VALID [2020-07-08 17:39:55,871 INFO L280 TraceCheckUtils]: 30: Hoare triple {2487#false} ~i~0 := 1 + ~i~0; {2487#false} is VALID [2020-07-08 17:39:55,872 INFO L280 TraceCheckUtils]: 31: Hoare triple {2487#false} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-08 17:39:55,872 INFO L280 TraceCheckUtils]: 32: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-08 17:39:55,872 INFO L280 TraceCheckUtils]: 33: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-08 17:39:55,872 INFO L280 TraceCheckUtils]: 34: Hoare triple {2487#false} assume !(~i~0 <= 100); {2487#false} is VALID [2020-07-08 17:39:55,872 INFO L263 TraceCheckUtils]: 35: Hoare triple {2487#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2487#false} is VALID [2020-07-08 17:39:55,873 INFO L280 TraceCheckUtils]: 36: Hoare triple {2487#false} ~cond := #in~cond; {2487#false} is VALID [2020-07-08 17:39:55,873 INFO L280 TraceCheckUtils]: 37: Hoare triple {2487#false} assume 0 == ~cond; {2487#false} is VALID [2020-07-08 17:39:55,873 INFO L280 TraceCheckUtils]: 38: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2020-07-08 17:39:55,875 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 17:39:55,875 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:55,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335324425] [2020-07-08 17:39:55,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:55,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 17:39:55,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407693040] [2020-07-08 17:39:55,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-08 17:39:55,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:55,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 17:39:55,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:55,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 17:39:55,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 17:39:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:39:55,924 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2020-07-08 17:39:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:56,555 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-08 17:39:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 17:39:56,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-08 17:39:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:39:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-08 17:39:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 17:39:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-08 17:39:56,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-08 17:39:56,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:56,619 INFO L225 Difference]: With dead ends: 62 [2020-07-08 17:39:56,620 INFO L226 Difference]: Without dead ends: 46 [2020-07-08 17:39:56,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-07-08 17:39:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-08 17:39:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-08 17:39:56,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:56,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-08 17:39:56,719 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-08 17:39:56,719 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-08 17:39:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:56,720 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-08 17:39:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-08 17:39:56,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:56,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:56,721 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-08 17:39:56,721 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-08 17:39:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:56,723 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-08 17:39:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-08 17:39:56,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:56,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:56,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:56,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-08 17:39:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-08 17:39:56,725 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2020-07-08 17:39:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:56,725 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-08 17:39:56,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 17:39:56,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2020-07-08 17:39:56,798 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 17:39:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-08 17:39:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:39:56,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:56,799 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:56,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 17:39:56,800 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:56,800 INFO L82 PathProgramCache]: Analyzing trace with hash -148422936, now seen corresponding path program 9 times [2020-07-08 17:39:56,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:56,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767580746] [2020-07-08 17:39:56,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:57,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-08 17:39:57,040 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-08 17:39:57,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {2824#true} call ULTIMATE.init(); {2824#true} is VALID [2020-07-08 17:39:57,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-08 17:39:57,040 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-08 17:39:57,041 INFO L263 TraceCheckUtils]: 3: Hoare triple {2824#true} call #t~ret0 := main(); {2824#true} is VALID [2020-07-08 17:39:57,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {2824#true} havoc ~i~0; {2824#true} is VALID [2020-07-08 17:39:57,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {2824#true} havoc ~j~0; {2824#true} is VALID [2020-07-08 17:39:57,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {2824#true} havoc ~k~0; {2824#true} is VALID [2020-07-08 17:39:57,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {2824#true} ~i~0 := 0; {2828#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:57,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {2828#(<= main_~i~0 0)} ~k~0 := 9; {2828#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:57,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {2828#(<= main_~i~0 0)} ~j~0 := -100; {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:57,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 17:39:57,047 INFO L280 TraceCheckUtils]: 11: Hoare triple {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,048 INFO L280 TraceCheckUtils]: 12: Hoare triple {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,051 INFO L280 TraceCheckUtils]: 15: Hoare triple {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,051 INFO L280 TraceCheckUtils]: 16: Hoare triple {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,052 INFO L280 TraceCheckUtils]: 17: Hoare triple {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,052 INFO L280 TraceCheckUtils]: 18: Hoare triple {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,053 INFO L280 TraceCheckUtils]: 19: Hoare triple {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,055 INFO L280 TraceCheckUtils]: 21: Hoare triple {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,055 INFO L280 TraceCheckUtils]: 22: Hoare triple {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,056 INFO L280 TraceCheckUtils]: 23: Hoare triple {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,056 INFO L280 TraceCheckUtils]: 24: Hoare triple {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,057 INFO L280 TraceCheckUtils]: 25: Hoare triple {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,057 INFO L280 TraceCheckUtils]: 26: Hoare triple {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} assume !!(~j~0 < 20); {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,058 INFO L280 TraceCheckUtils]: 27: Hoare triple {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2838#(<= (+ main_~j~0 92) 0)} is VALID [2020-07-08 17:39:57,058 INFO L280 TraceCheckUtils]: 28: Hoare triple {2838#(<= (+ main_~j~0 92) 0)} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-08 17:39:57,059 INFO L280 TraceCheckUtils]: 29: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-08 17:39:57,059 INFO L280 TraceCheckUtils]: 30: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-08 17:39:57,059 INFO L280 TraceCheckUtils]: 31: Hoare triple {2825#false} assume !!(~i~0 <= 100); {2825#false} is VALID [2020-07-08 17:39:57,059 INFO L280 TraceCheckUtils]: 32: Hoare triple {2825#false} ~i~0 := 1 + ~i~0; {2825#false} is VALID [2020-07-08 17:39:57,059 INFO L280 TraceCheckUtils]: 33: Hoare triple {2825#false} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-08 17:39:57,060 INFO L280 TraceCheckUtils]: 34: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-08 17:39:57,060 INFO L280 TraceCheckUtils]: 35: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-08 17:39:57,061 INFO L280 TraceCheckUtils]: 36: Hoare triple {2825#false} assume !(~i~0 <= 100); {2825#false} is VALID [2020-07-08 17:39:57,061 INFO L263 TraceCheckUtils]: 37: Hoare triple {2825#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2825#false} is VALID [2020-07-08 17:39:57,061 INFO L280 TraceCheckUtils]: 38: Hoare triple {2825#false} ~cond := #in~cond; {2825#false} is VALID [2020-07-08 17:39:57,061 INFO L280 TraceCheckUtils]: 39: Hoare triple {2825#false} assume 0 == ~cond; {2825#false} is VALID [2020-07-08 17:39:57,062 INFO L280 TraceCheckUtils]: 40: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2020-07-08 17:39:57,064 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 17:39:57,064 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:57,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767580746] [2020-07-08 17:39:57,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:57,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:39:57,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129510674] [2020-07-08 17:39:57,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-08 17:39:57,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:57,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:39:57,120 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 17:39:57,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:39:57,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:39:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:39:57,121 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2020-07-08 17:39:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:57,824 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-08 17:39:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:39:57,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-08 17:39:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-08 17:39:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-08 17:39:57,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2020-07-08 17:39:57,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:57,893 INFO L225 Difference]: With dead ends: 64 [2020-07-08 17:39:57,894 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 17:39:57,894 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-08 17:39:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 17:39:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-08 17:39:58,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:58,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-08 17:39:58,014 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-08 17:39:58,014 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-08 17:39:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,016 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-08 17:39:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-08 17:39:58,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,016 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-08 17:39:58,016 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-08 17:39:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,017 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-08 17:39:58,017 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-08 17:39:58,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:58,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:58,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 17:39:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-08 17:39:58,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2020-07-08 17:39:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:58,019 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-08 17:39:58,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:39:58,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-08 17:39:58,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-08 17:39:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 17:39:58,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:58,106 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:58,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 17:39:58,107 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2058880295, now seen corresponding path program 10 times [2020-07-08 17:39:58,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:58,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1103203126] [2020-07-08 17:39:58,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:58,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-08 17:39:58,234 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-08 17:39:58,235 INFO L263 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2020-07-08 17:39:58,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-08 17:39:58,235 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-08 17:39:58,235 INFO L263 TraceCheckUtils]: 3: Hoare triple {3177#true} call #t~ret0 := main(); {3177#true} is VALID [2020-07-08 17:39:58,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {3177#true} havoc ~i~0; {3177#true} is VALID [2020-07-08 17:39:58,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~j~0; {3177#true} is VALID [2020-07-08 17:39:58,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {3177#true} havoc ~k~0; {3177#true} is VALID [2020-07-08 17:39:58,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {3177#true} ~i~0 := 0; {3181#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:58,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {3181#(<= main_~i~0 0)} ~k~0 := 9; {3181#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:58,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {3181#(<= main_~i~0 0)} ~j~0 := -100; {3181#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:58,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {3181#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {3181#(<= main_~i~0 0)} is VALID [2020-07-08 17:39:58,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {3181#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,246 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,254 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,254 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,255 INFO L280 TraceCheckUtils]: 22: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,255 INFO L280 TraceCheckUtils]: 23: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,255 INFO L280 TraceCheckUtils]: 24: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,256 INFO L280 TraceCheckUtils]: 25: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,256 INFO L280 TraceCheckUtils]: 26: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,256 INFO L280 TraceCheckUtils]: 27: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,257 INFO L280 TraceCheckUtils]: 28: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,257 INFO L280 TraceCheckUtils]: 29: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,258 INFO L280 TraceCheckUtils]: 30: Hoare triple {3182#(<= main_~i~0 1)} assume !(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,258 INFO L280 TraceCheckUtils]: 31: Hoare triple {3182#(<= main_~i~0 1)} ~k~0 := 4; {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,258 INFO L280 TraceCheckUtils]: 32: Hoare triple {3182#(<= main_~i~0 1)} assume !(~k~0 <= 3); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,259 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~i~0 <= 100); {3182#(<= main_~i~0 1)} is VALID [2020-07-08 17:39:58,259 INFO L280 TraceCheckUtils]: 34: Hoare triple {3182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3183#(<= main_~i~0 2)} is VALID [2020-07-08 17:39:58,260 INFO L280 TraceCheckUtils]: 35: Hoare triple {3183#(<= main_~i~0 2)} assume !(~j~0 < 20); {3183#(<= main_~i~0 2)} is VALID [2020-07-08 17:39:58,260 INFO L280 TraceCheckUtils]: 36: Hoare triple {3183#(<= main_~i~0 2)} ~k~0 := 4; {3183#(<= main_~i~0 2)} is VALID [2020-07-08 17:39:58,261 INFO L280 TraceCheckUtils]: 37: Hoare triple {3183#(<= main_~i~0 2)} assume !(~k~0 <= 3); {3183#(<= main_~i~0 2)} is VALID [2020-07-08 17:39:58,261 INFO L280 TraceCheckUtils]: 38: Hoare triple {3183#(<= main_~i~0 2)} assume !(~i~0 <= 100); {3178#false} is VALID [2020-07-08 17:39:58,261 INFO L263 TraceCheckUtils]: 39: Hoare triple {3178#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3178#false} is VALID [2020-07-08 17:39:58,261 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#false} ~cond := #in~cond; {3178#false} is VALID [2020-07-08 17:39:58,262 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#false} assume 0 == ~cond; {3178#false} is VALID [2020-07-08 17:39:58,262 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2020-07-08 17:39:58,263 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 17:39:58,263 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:58,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1103203126] [2020-07-08 17:39:58,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:39:58,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073048454] [2020-07-08 17:39:58,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 17:39:58,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:58,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:39:58,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:58,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:39:58,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:58,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:39:58,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:58,296 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-08 17:39:58,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,492 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-08 17:39:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 17:39:58,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-08 17:39:58,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-08 17:39:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-08 17:39:58,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-08 17:39:58,561 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 17:39:58,562 INFO L225 Difference]: With dead ends: 60 [2020-07-08 17:39:58,563 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 17:39:58,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 17:39:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-08 17:39:58,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:58,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2020-07-08 17:39:58,678 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2020-07-08 17:39:58,678 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2020-07-08 17:39:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,680 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-08 17:39:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-08 17:39:58,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,681 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2020-07-08 17:39:58,681 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2020-07-08 17:39:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,682 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-08 17:39:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-08 17:39:58,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:58,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-08 17:39:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-08 17:39:58,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2020-07-08 17:39:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:58,685 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-08 17:39:58,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:39:58,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2020-07-08 17:39:58,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-08 17:39:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 17:39:58,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:58,764 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:58,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 17:39:58,765 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -135810616, now seen corresponding path program 11 times [2020-07-08 17:39:58,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:58,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683855903] [2020-07-08 17:39:58,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:58,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-08 17:39:58,901 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-08 17:39:58,902 INFO L263 TraceCheckUtils]: 0: Hoare triple {3524#true} call ULTIMATE.init(); {3524#true} is VALID [2020-07-08 17:39:58,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-08 17:39:58,902 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-08 17:39:58,902 INFO L263 TraceCheckUtils]: 3: Hoare triple {3524#true} call #t~ret0 := main(); {3524#true} is VALID [2020-07-08 17:39:58,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {3524#true} havoc ~i~0; {3524#true} is VALID [2020-07-08 17:39:58,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {3524#true} havoc ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {3524#true} havoc ~k~0; {3524#true} is VALID [2020-07-08 17:39:58,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {3524#true} ~i~0 := 0; {3524#true} is VALID [2020-07-08 17:39:58,903 INFO L280 TraceCheckUtils]: 8: Hoare triple {3524#true} ~k~0 := 9; {3524#true} is VALID [2020-07-08 17:39:58,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {3524#true} ~j~0 := -100; {3524#true} is VALID [2020-07-08 17:39:58,904 INFO L280 TraceCheckUtils]: 10: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-08 17:39:58,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-08 17:39:58,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,905 INFO L280 TraceCheckUtils]: 15: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,905 INFO L280 TraceCheckUtils]: 16: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,905 INFO L280 TraceCheckUtils]: 17: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,905 INFO L280 TraceCheckUtils]: 18: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,906 INFO L280 TraceCheckUtils]: 19: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,906 INFO L280 TraceCheckUtils]: 21: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,906 INFO L280 TraceCheckUtils]: 22: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,906 INFO L280 TraceCheckUtils]: 23: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,907 INFO L280 TraceCheckUtils]: 24: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,907 INFO L280 TraceCheckUtils]: 25: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,907 INFO L280 TraceCheckUtils]: 26: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,907 INFO L280 TraceCheckUtils]: 27: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,907 INFO L280 TraceCheckUtils]: 28: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 29: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 30: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 31: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 32: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 33: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-08 17:39:58,908 INFO L280 TraceCheckUtils]: 34: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 35: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 36: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 37: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 38: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 39: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-08 17:39:58,909 INFO L280 TraceCheckUtils]: 40: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-08 17:39:58,910 INFO L280 TraceCheckUtils]: 41: Hoare triple {3524#true} ~k~0 := 4; {3528#(= 4 main_~k~0)} is VALID [2020-07-08 17:39:58,910 INFO L280 TraceCheckUtils]: 42: Hoare triple {3528#(= 4 main_~k~0)} assume !(~k~0 <= 3); {3528#(= 4 main_~k~0)} is VALID [2020-07-08 17:39:58,911 INFO L280 TraceCheckUtils]: 43: Hoare triple {3528#(= 4 main_~k~0)} assume !(~i~0 <= 100); {3528#(= 4 main_~k~0)} is VALID [2020-07-08 17:39:58,911 INFO L263 TraceCheckUtils]: 44: Hoare triple {3528#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3529#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:39:58,912 INFO L280 TraceCheckUtils]: 45: Hoare triple {3529#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3530#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:39:58,912 INFO L280 TraceCheckUtils]: 46: Hoare triple {3530#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3525#false} is VALID [2020-07-08 17:39:58,912 INFO L280 TraceCheckUtils]: 47: Hoare triple {3525#false} assume !false; {3525#false} is VALID [2020-07-08 17:39:58,913 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 17:39:58,914 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:58,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683855903] [2020-07-08 17:39:58,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:58,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:39:58,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695238989] [2020-07-08 17:39:58,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-08 17:39:58,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:58,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:39:58,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:58,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:39:58,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:39:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:58,949 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-08 17:39:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:59,161 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-07-08 17:39:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 17:39:59,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-08 17:39:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 17:39:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:39:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 17:39:59,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-08 17:39:59,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:59,213 INFO L225 Difference]: With dead ends: 71 [2020-07-08 17:39:59,213 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 17:39:59,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:39:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 17:39:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 17:39:59,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:59,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:59,216 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:59,216 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:59,217 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:59,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:59,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:59,217 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:59,218 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:59,218 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:59,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:59,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:59,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:59,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 17:39:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 17:39:59,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-08 17:39:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:59,219 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 17:39:59,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:39:59,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 17:39:59,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:59,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:59,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 17:39:59,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,607 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:59,608 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:59,608 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 17:39:59,608 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 17:39:59,608 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 17:39:59,608 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-07-08 17:39:59,608 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 30) the Hoare annotation is: true [2020-07-08 17:39:59,608 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-08 17:39:59,609 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-08 17:39:59,609 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= main_~i~0 0) [2020-07-08 17:39:59,609 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 17:39:59,609 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 30) the Hoare annotation is: true [2020-07-08 17:39:59,609 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-08 17:39:59,609 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-08 17:39:59,609 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-08 17:39:59,609 INFO L264 CegarLoopResult]: At program point L24-3(lines 18 27) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-08 17:39:59,610 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-08 17:39:59,610 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-08 17:39:59,610 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= main_~i~0 0) [2020-07-08 17:39:59,610 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-08 17:39:59,610 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 17:39:59,610 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-08 17:39:59,610 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 17:39:59,610 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-08 17:39:59,610 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:59,611 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 17:39:59,611 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-08 17:39:59,611 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 17:39:59,614 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 17:39:59,615 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:59,615 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 17:39:59,616 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 17:39:59,616 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 17:39:59,621 INFO L163 areAnnotationChecker]: CFG has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 17:39:59,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:39:59 BoogieIcfgContainer [2020-07-08 17:39:59,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:39:59,638 INFO L168 Benchmark]: Toolchain (without parser) took 19781.65 ms. Allocated memory was 138.9 MB in the beginning and 322.4 MB in the end (delta: 183.5 MB). Free memory was 104.0 MB in the beginning and 266.4 MB in the end (delta: -162.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,639 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.78 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,640 INFO L168 Benchmark]: Boogie Preprocessor took 37.91 ms. Allocated memory is still 138.9 MB. Free memory was 94.1 MB in the beginning and 92.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,641 INFO L168 Benchmark]: RCFGBuilder took 486.61 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 92.5 MB in the beginning and 165.6 MB in the end (delta: -73.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,641 INFO L168 Benchmark]: TraceAbstraction took 19002.73 ms. Allocated memory was 203.9 MB in the beginning and 322.4 MB in the end (delta: 118.5 MB). Free memory was 165.6 MB in the beginning and 266.4 MB in the end (delta: -100.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,645 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.38 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.78 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 94.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.91 ms. Allocated memory is still 138.9 MB. Free memory was 94.1 MB in the beginning and 92.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 486.61 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 92.5 MB in the beginning and 165.6 MB in the end (delta: -73.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19002.73 ms. Allocated memory was 203.9 MB in the beginning and 322.4 MB in the end (delta: 118.5 MB). Free memory was 165.6 MB in the beginning and 266.4 MB in the end (delta: -100.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 4 == k - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 4 == k || i <= 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (i <= 0 && j + 100 <= 0) || 4 == k - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.5s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 301 SDtfs, 135 SDslu, 1038 SDs, 0 SdLazy, 554 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 113 PreInvPairs, 187 NumberOfFragments, 90 HoareAnnotationTreeSize, 113 FomulaSimplifications, 5869 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...