/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-8fc6572 [2020-07-10 20:24:35,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:35,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:35,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:35,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:35,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:35,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:35,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:35,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:35,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:35,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:35,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:35,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:35,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:35,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:35,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:35,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:35,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:35,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:35,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:35,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:35,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:35,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:35,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:35,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:35,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:35,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:35,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:35,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:35,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:35,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:35,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:35,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:35,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:35,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:35,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:35,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:35,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:35,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:35,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:35,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:35,186 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:35,195 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:35,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:35,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:35,197 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:35,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:35,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:35,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:35,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:35,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:35,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:35,198 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:35,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:35,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:35,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:35,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:35,199 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:35,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:35,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:35,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:35,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:35,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:35,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:35,201 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:35,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:35,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:35,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:35,499 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:35,500 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:35,501 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-10 20:24:35,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268a9d250/c7211e31b93544c490ab2137894b02e4/FLAGa8832e197 [2020-07-10 20:24:36,020 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:36,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-10 20:24:36,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268a9d250/c7211e31b93544c490ab2137894b02e4/FLAGa8832e197 [2020-07-10 20:24:36,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268a9d250/c7211e31b93544c490ab2137894b02e4 [2020-07-10 20:24:36,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:36,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:36,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:36,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:36,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:36,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b778e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36, skipping insertion in model container [2020-07-10 20:24:36,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:36,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:36,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:36,628 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:36,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:36,662 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:36,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36 WrapperNode [2020-07-10 20:24:36,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:36,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:36,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:36,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:36,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... [2020-07-10 20:24:36,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:36,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:36,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:36,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:36,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:36,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:37,110 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:37,110 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 20:24:37,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:37 BoogieIcfgContainer [2020-07-10 20:24:37,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:37,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:37,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:37,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:37,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:36" (1/3) ... [2020-07-10 20:24:37,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74536375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:37, skipping insertion in model container [2020-07-10 20:24:37,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:36" (2/3) ... [2020-07-10 20:24:37,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74536375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:37, skipping insertion in model container [2020-07-10 20:24:37,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:37" (3/3) ... [2020-07-10 20:24:37,127 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-10 20:24:37,141 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:37,150 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:37,173 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:37,207 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:37,207 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:37,207 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:37,207 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:37,208 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:37,208 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:37,208 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:37,208 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 20:24:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 20:24:37,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:37,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:37,237 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1930258608, now seen corresponding path program 1 times [2020-07-10 20:24:37,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:37,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839794947] [2020-07-10 20:24:37,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 20:24:37,416 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-10 20:24:37,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-10 20:24:37,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 20:24:37,419 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-10 20:24:37,420 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret0 := main(); {32#true} is VALID [2020-07-10 20:24:37,420 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0; {32#true} is VALID [2020-07-10 20:24:37,421 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~j~0; {32#true} is VALID [2020-07-10 20:24:37,421 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~k~0; {32#true} is VALID [2020-07-10 20:24:37,421 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i~0 := 0; {32#true} is VALID [2020-07-10 20:24:37,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~k~0 := 9; {32#true} is VALID [2020-07-10 20:24:37,429 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} ~j~0 := -100; {32#true} is VALID [2020-07-10 20:24:37,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-10 20:24:37,431 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-10 20:24:37,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-10 20:24:37,432 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-10 20:24:37,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 20:24:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:37,435 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:37,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839794947] [2020-07-10 20:24:37,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:37,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:24:37,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851547749] [2020-07-10 20:24:37,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-10 20:24:37,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:37,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:24:37,493 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-10 20:24:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:24:37,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:24:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:24:37,506 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-10 20:24:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,634 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-10 20:24:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:24:37,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-10 20:24:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-10 20:24:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-10 20:24:37,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-10 20:24:37,793 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-10 20:24:37,807 INFO L225 Difference]: With dead ends: 48 [2020-07-10 20:24:37,807 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 20:24:37,811 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-10 20:24:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 20:24:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 20:24:37,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:37,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 20:24:37,863 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 20:24:37,863 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 20:24:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,867 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-10 20:24:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-10 20:24:37,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,869 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 20:24:37,869 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 20:24:37,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:37,874 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-10 20:24:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-10 20:24:37,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:37,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:37,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:37,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 20:24:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-10 20:24:37,880 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-10 20:24:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:37,881 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-10 20:24:37,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:24:37,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2020-07-10 20:24:37,914 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-10 20:24:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-10 20:24:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 20:24:37,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:37,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:37,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:37,916 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1900705936, now seen corresponding path program 1 times [2020-07-10 20:24:37,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:37,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921964877] [2020-07-10 20:24:37,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:37,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-10 20:24:37,975 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-10 20:24:37,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2020-07-10 20:24:37,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-10 20:24:37,976 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-10 20:24:37,976 INFO L263 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2020-07-10 20:24:37,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0; {222#true} is VALID [2020-07-10 20:24:37,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {222#true} havoc ~j~0; {222#true} is VALID [2020-07-10 20:24:37,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#true} havoc ~k~0; {222#true} is VALID [2020-07-10 20:24:37,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#true} ~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:37,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 0)} ~k~0 := 9; {226#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:37,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~i~0 0)} ~j~0 := -100; {226#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:37,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~i~0 0)} assume !(~i~0 <= 100); {223#false} is VALID [2020-07-10 20:24:37,982 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-10 20:24:37,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2020-07-10 20:24:37,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2020-07-10 20:24:37,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {223#false} assume !false; {223#false} is VALID [2020-07-10 20:24:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:37,985 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:37,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921964877] [2020-07-10 20:24:37,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:37,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:24:37,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123301257] [2020-07-10 20:24:37,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 20:24:37,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:37,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:24:38,010 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-10 20:24:38,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:24:38,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:24:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:24:38,011 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-10 20:24:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:38,084 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-10 20:24:38,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:24:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-10 20:24:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:24:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-10 20:24:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:24:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-10 20:24:38,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2020-07-10 20:24:38,133 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-10 20:24:38,134 INFO L225 Difference]: With dead ends: 29 [2020-07-10 20:24:38,135 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 20:24:38,136 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-10 20:24:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 20:24:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-10 20:24:38,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:38,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-10 20:24:38,171 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-10 20:24:38,171 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-10 20:24:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:38,173 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 20:24:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 20:24:38,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:38,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:38,174 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-10 20:24:38,175 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-10 20:24:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:38,177 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 20:24:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 20:24:38,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:38,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:38,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:38,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 20:24:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 20:24:38,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-10 20:24:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:38,181 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 20:24:38,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:24:38,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2020-07-10 20:24:38,212 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-10 20:24:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 20:24:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 20:24:38,213 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:38,214 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-10 20:24:38,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:38,214 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1024587775, now seen corresponding path program 1 times [2020-07-10 20:24:38,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:38,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [717901641] [2020-07-10 20:24:38,215 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-10 20:24:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-10 20:24:40,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-10 20:24:40,543 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-10 20:24:40,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-10 20:24:40,544 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-10 20:24:40,545 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret0 := main(); {381#true} is VALID [2020-07-10 20:24:40,545 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0; {381#true} is VALID [2020-07-10 20:24:40,545 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#true} havoc ~j~0; {381#true} is VALID [2020-07-10 20:24:40,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {381#true} havoc ~k~0; {381#true} is VALID [2020-07-10 20:24:40,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {381#true} ~i~0 := 0; {381#true} is VALID [2020-07-10 20:24:40,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {381#true} ~k~0 := 9; {381#true} is VALID [2020-07-10 20:24:40,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#true} ~j~0 := -100; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-10 20:24:40,551 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-10 20:24:40,552 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-10 20:24:40,552 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-10 20:24:40,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-10 20:24:40,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-10 20:24:40,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-10 20:24:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:40,605 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:40,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [717901641] [2020-07-10 20:24:40,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:40,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:40,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811274775] [2020-07-10 20:24:40,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 20:24:40,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:40,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:40,632 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-10 20:24:40,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:40,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:40,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:40,633 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2020-07-10 20:24:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:40,742 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 20:24:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:24:40,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-10 20:24:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-10 20:24:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-10 20:24:40,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-10 20:24:40,802 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-10 20:24:40,804 INFO L225 Difference]: With dead ends: 38 [2020-07-10 20:24:40,804 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 20:24:40,804 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-10 20:24:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 20:24:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-10 20:24:40,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:40,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-10 20:24:40,831 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-10 20:24:40,831 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-10 20:24:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:40,833 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 20:24:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 20:24:40,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:40,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:40,834 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-10 20:24:40,834 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-10 20:24:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:40,836 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-10 20:24:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-10 20:24:40,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:40,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:40,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:40,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 20:24:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 20:24:40,839 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-10 20:24:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:40,840 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 20:24:40,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:40,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-10 20:24:40,873 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-10 20:24:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 20:24:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 20:24:40,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:40,875 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-10 20:24:40,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:40,875 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:40,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2065885280, now seen corresponding path program 1 times [2020-07-10 20:24:40,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:40,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1250808650] [2020-07-10 20:24:40,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:40,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-10 20:24:40,942 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-10 20:24:40,943 INFO L263 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2020-07-10 20:24:40,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-10 20:24:40,943 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-10 20:24:40,944 INFO L263 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret0 := main(); {568#true} is VALID [2020-07-10 20:24:40,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {568#true} havoc ~i~0; {568#true} is VALID [2020-07-10 20:24:40,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~j~0; {568#true} is VALID [2020-07-10 20:24:40,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {568#true} havoc ~k~0; {568#true} is VALID [2020-07-10 20:24:40,946 INFO L280 TraceCheckUtils]: 7: Hoare triple {568#true} ~i~0 := 0; {572#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:40,947 INFO L280 TraceCheckUtils]: 8: Hoare triple {572#(<= main_~i~0 0)} ~k~0 := 9; {572#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:40,948 INFO L280 TraceCheckUtils]: 9: Hoare triple {572#(<= main_~i~0 0)} ~j~0 := -100; {572#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:40,948 INFO L280 TraceCheckUtils]: 10: Hoare triple {572#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {572#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:40,949 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-10 20:24:40,950 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#(<= main_~i~0 1)} assume !!(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:40,951 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-10 20:24:40,952 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#(<= main_~i~0 1)} assume !(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:40,952 INFO L280 TraceCheckUtils]: 15: Hoare triple {573#(<= main_~i~0 1)} ~k~0 := 4; {573#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:40,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#(<= main_~i~0 1)} assume !(~k~0 <= 3); {573#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:40,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {573#(<= main_~i~0 1)} assume !(~i~0 <= 100); {569#false} is VALID [2020-07-10 20:24:40,954 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-10 20:24:40,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2020-07-10 20:24:40,955 INFO L280 TraceCheckUtils]: 20: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2020-07-10 20:24:40,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {569#false} assume !false; {569#false} is VALID [2020-07-10 20:24:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:40,956 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:40,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1250808650] [2020-07-10 20:24:40,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:40,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:24:40,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525487336] [2020-07-10 20:24:40,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 20:24:40,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:40,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:24:40,987 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-10 20:24:40,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:24:40,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:24:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:24:40,988 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-10 20:24:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,082 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-10 20:24:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:24:41,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 20:24:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:24:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-10 20:24:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:24:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-10 20:24:41,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-10 20:24:41,135 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-10 20:24:41,136 INFO L225 Difference]: With dead ends: 37 [2020-07-10 20:24:41,137 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 20:24:41,137 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-10 20:24:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 20:24:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-10 20:24:41,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:41,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-10 20:24:41,173 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-10 20:24:41,174 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-10 20:24:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,176 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 20:24:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 20:24:41,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:41,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:41,178 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-10 20:24:41,178 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-10 20:24:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:41,181 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-10 20:24:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 20:24:41,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:41,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:41,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:41,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:24:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-10 20:24:41,184 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-10 20:24:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:41,185 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-10 20:24:41,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:24:41,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-10 20:24:41,233 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-10 20:24:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 20:24:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:24:41,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:41,235 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-10 20:24:41,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:24:41,235 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1729554991, now seen corresponding path program 2 times [2020-07-10 20:24:41,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:41,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1562048044] [2020-07-10 20:24:41,237 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-10 20:24:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:43,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:24:43,494 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-10 20:24:43,494 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2020-07-10 20:24:43,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-10 20:24:43,495 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-10 20:24:43,498 INFO L263 TraceCheckUtils]: 3: Hoare triple {776#true} call #t~ret0 := main(); {776#true} is VALID [2020-07-10 20:24:43,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} havoc ~i~0; {776#true} is VALID [2020-07-10 20:24:43,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} havoc ~j~0; {776#true} is VALID [2020-07-10 20:24:43,499 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#true} havoc ~k~0; {776#true} is VALID [2020-07-10 20:24:43,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} ~i~0 := 0; {776#true} is VALID [2020-07-10 20:24:43,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} ~k~0 := 9; {776#true} is VALID [2020-07-10 20:24:43,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} ~j~0 := -100; {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-10 20:24:43,501 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-10 20:24:43,502 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-10 20:24:43,502 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-10 20:24:43,506 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-10 20:24:43,507 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-10 20:24:43,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {782#(<= 120 main_~i~0)} ~k~0 := 4; {782#(<= 120 main_~i~0)} is VALID [2020-07-10 20:24:43,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {782#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {782#(<= 120 main_~i~0)} is VALID [2020-07-10 20:24:43,512 INFO L280 TraceCheckUtils]: 17: Hoare triple {782#(<= 120 main_~i~0)} assume !!(~i~0 <= 100); {777#false} is VALID [2020-07-10 20:24:43,513 INFO L280 TraceCheckUtils]: 18: Hoare triple {777#false} ~i~0 := 1 + ~i~0; {777#false} is VALID [2020-07-10 20:24:43,513 INFO L280 TraceCheckUtils]: 19: Hoare triple {777#false} assume !(~j~0 < 20); {777#false} is VALID [2020-07-10 20:24:43,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {777#false} ~k~0 := 4; {777#false} is VALID [2020-07-10 20:24:43,513 INFO L280 TraceCheckUtils]: 21: Hoare triple {777#false} assume !(~k~0 <= 3); {777#false} is VALID [2020-07-10 20:24:43,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {777#false} assume !(~i~0 <= 100); {777#false} is VALID [2020-07-10 20:24:43,514 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-10 20:24:43,514 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2020-07-10 20:24:43,515 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2020-07-10 20:24:43,515 INFO L280 TraceCheckUtils]: 26: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-10 20:24:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:43,516 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:43,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1562048044] [2020-07-10 20:24:43,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:43,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:43,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652038914] [2020-07-10 20:24:43,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:24:43,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:43,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:43,551 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-10 20:24:43,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:43,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:43,553 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-10 20:24:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:43,755 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-10 20:24:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:24:43,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 20:24:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 20:24:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-10 20:24:43,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-10 20:24:43,807 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-10 20:24:43,809 INFO L225 Difference]: With dead ends: 50 [2020-07-10 20:24:43,810 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 20:24:43,810 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-10 20:24:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 20:24:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-10 20:24:43,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:43,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-10 20:24:43,845 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-10 20:24:43,845 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-10 20:24:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:43,847 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-10 20:24:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 20:24:43,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:43,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:43,849 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-10 20:24:43,849 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-10 20:24:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:43,851 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-10 20:24:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 20:24:43,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:43,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:43,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:43,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:24:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 20:24:43,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-10 20:24:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:43,864 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 20:24:43,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:43,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-10 20:24:43,901 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-10 20:24:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 20:24:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:24:43,904 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:43,904 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-10 20:24:43,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:24:43,904 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1385563474, now seen corresponding path program 3 times [2020-07-10 20:24:43,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:43,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984171526] [2020-07-10 20:24:43,905 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-10 20:24:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:46,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-10 20:24:46,132 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-10 20:24:46,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2020-07-10 20:24:46,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-10 20:24:46,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-10 20:24:46,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {1021#true} call #t~ret0 := main(); {1021#true} is VALID [2020-07-10 20:24:46,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {1021#true} havoc ~i~0; {1021#true} is VALID [2020-07-10 20:24:46,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~j~0; {1021#true} is VALID [2020-07-10 20:24:46,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {1021#true} havoc ~k~0; {1021#true} is VALID [2020-07-10 20:24:46,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#true} ~i~0 := 0; {1025#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:46,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {1025#(<= main_~i~0 0)} ~k~0 := 9; {1025#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:46,137 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-10 20:24:46,138 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-10 20:24:46,139 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-10 20:24:46,140 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-10 20:24:46,141 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-10 20:24:46,160 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-10 20:24:46,169 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-10 20:24:46,173 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-10 20:24:46,173 INFO L280 TraceCheckUtils]: 17: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-10 20:24:46,173 INFO L280 TraceCheckUtils]: 18: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-10 20:24:46,174 INFO L280 TraceCheckUtils]: 19: Hoare triple {1022#false} assume !!(~i~0 <= 100); {1022#false} is VALID [2020-07-10 20:24:46,174 INFO L280 TraceCheckUtils]: 20: Hoare triple {1022#false} ~i~0 := 1 + ~i~0; {1022#false} is VALID [2020-07-10 20:24:46,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {1022#false} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-10 20:24:46,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-10 20:24:46,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-10 20:24:46,176 INFO L280 TraceCheckUtils]: 24: Hoare triple {1022#false} assume !(~i~0 <= 100); {1022#false} is VALID [2020-07-10 20:24:46,176 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-10 20:24:46,176 INFO L280 TraceCheckUtils]: 26: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2020-07-10 20:24:46,177 INFO L280 TraceCheckUtils]: 27: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2020-07-10 20:24:46,177 INFO L280 TraceCheckUtils]: 28: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2020-07-10 20:24:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:46,184 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:46,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984171526] [2020-07-10 20:24:46,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:46,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:24:46,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219469602] [2020-07-10 20:24:46,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:24:46,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:46,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:24:46,218 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-10 20:24:46,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:24:46,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:24:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:24:46,219 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-10 20:24:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:46,530 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-10 20:24:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:24:46,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-10 20:24:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 20:24:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:24:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 20:24:46,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-10 20:24:46,579 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-10 20:24:46,581 INFO L225 Difference]: With dead ends: 52 [2020-07-10 20:24:46,581 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 20:24:46,582 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-10 20:24:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 20:24:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-10 20:24:46,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:46,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-10 20:24:46,610 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-10 20:24:46,610 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-10 20:24:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:46,612 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 20:24:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 20:24:46,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:46,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:46,612 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-10 20:24:46,613 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-10 20:24:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:46,614 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 20:24:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 20:24:46,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:46,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:46,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:46,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 20:24:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 20:24:46,616 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2020-07-10 20:24:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:46,616 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 20:24:46,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:24:46,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-10 20:24:46,661 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-10 20:24:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 20:24:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:24:46,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:46,663 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-10 20:24:46,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:24:46,664 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1422203027, now seen corresponding path program 4 times [2020-07-10 20:24:46,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:46,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299950285] [2020-07-10 20:24:46,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:46,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 20:24:46,805 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-10 20:24:46,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2020-07-10 20:24:46,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-10 20:24:46,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-10 20:24:46,807 INFO L263 TraceCheckUtils]: 3: Hoare triple {1284#true} call #t~ret0 := main(); {1284#true} is VALID [2020-07-10 20:24:46,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} havoc ~i~0; {1284#true} is VALID [2020-07-10 20:24:46,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~j~0; {1284#true} is VALID [2020-07-10 20:24:46,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {1284#true} havoc ~k~0; {1284#true} is VALID [2020-07-10 20:24:46,808 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~i~0 := 0; {1288#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:46,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {1288#(<= main_~i~0 0)} ~k~0 := 9; {1288#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:46,810 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-10 20:24:46,810 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-10 20:24:46,811 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-10 20:24:46,812 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-10 20:24:46,813 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-10 20:24:46,814 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-10 20:24:46,815 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-10 20:24:46,816 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-10 20:24:46,817 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-10 20:24:46,818 INFO L280 TraceCheckUtils]: 18: Hoare triple {1293#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-10 20:24:46,818 INFO L280 TraceCheckUtils]: 19: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-10 20:24:46,818 INFO L280 TraceCheckUtils]: 20: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-10 20:24:46,818 INFO L280 TraceCheckUtils]: 21: Hoare triple {1285#false} assume !!(~i~0 <= 100); {1285#false} is VALID [2020-07-10 20:24:46,819 INFO L280 TraceCheckUtils]: 22: Hoare triple {1285#false} ~i~0 := 1 + ~i~0; {1285#false} is VALID [2020-07-10 20:24:46,819 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-10 20:24:46,819 INFO L280 TraceCheckUtils]: 24: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-10 20:24:46,819 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-10 20:24:46,820 INFO L280 TraceCheckUtils]: 26: Hoare triple {1285#false} assume !(~i~0 <= 100); {1285#false} is VALID [2020-07-10 20:24:46,820 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-10 20:24:46,820 INFO L280 TraceCheckUtils]: 28: Hoare triple {1285#false} ~cond := #in~cond; {1285#false} is VALID [2020-07-10 20:24:46,820 INFO L280 TraceCheckUtils]: 29: Hoare triple {1285#false} assume 0 == ~cond; {1285#false} is VALID [2020-07-10 20:24:46,820 INFO L280 TraceCheckUtils]: 30: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-10 20:24:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:46,823 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:46,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299950285] [2020-07-10 20:24:46,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:46,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:46,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280543663] [2020-07-10 20:24:46,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-10 20:24:46,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:46,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:46,855 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-10 20:24:46,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:46,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:46,856 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-07-10 20:24:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:47,173 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-10 20:24:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:24:47,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-10 20:24:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-10 20:24:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-10 20:24:47,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-10 20:24:47,239 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-10 20:24:47,241 INFO L225 Difference]: With dead ends: 54 [2020-07-10 20:24:47,241 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:24:47,242 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-10 20:24:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:24:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-10 20:24:47,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:47,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:47,284 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:47,285 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:47,286 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 20:24:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 20:24:47,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:47,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:47,287 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-10 20:24:47,287 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-10 20:24:47,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:47,289 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 20:24:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 20:24:47,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:47,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:47,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:47,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 20:24:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-10 20:24:47,292 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2020-07-10 20:24:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:47,293 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-10 20:24:47,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:47,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-10 20:24:47,351 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-10 20:24:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-10 20:24:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 20:24:47,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:47,353 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-10 20:24:47,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:24:47,353 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892204, now seen corresponding path program 5 times [2020-07-10 20:24:47,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:47,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402854989] [2020-07-10 20:24:47,354 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-10 20:24:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:49,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-10 20:24:49,635 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-10 20:24:49,636 INFO L263 TraceCheckUtils]: 0: Hoare triple {1562#true} call ULTIMATE.init(); {1562#true} is VALID [2020-07-10 20:24:49,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-10 20:24:49,636 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-10 20:24:49,637 INFO L263 TraceCheckUtils]: 3: Hoare triple {1562#true} call #t~ret0 := main(); {1562#true} is VALID [2020-07-10 20:24:49,637 INFO L280 TraceCheckUtils]: 4: Hoare triple {1562#true} havoc ~i~0; {1562#true} is VALID [2020-07-10 20:24:49,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {1562#true} havoc ~j~0; {1562#true} is VALID [2020-07-10 20:24:49,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {1562#true} havoc ~k~0; {1562#true} is VALID [2020-07-10 20:24:49,638 INFO L280 TraceCheckUtils]: 7: Hoare triple {1562#true} ~i~0 := 0; {1566#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:49,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {1566#(<= main_~i~0 0)} ~k~0 := 9; {1566#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:49,639 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-10 20:24:49,640 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-10 20:24:49,641 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-10 20:24:49,642 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-10 20:24:49,643 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-10 20:24:49,644 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-10 20:24:49,645 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-10 20:24:49,645 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-10 20:24:49,646 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-10 20:24:49,646 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-10 20:24:49,647 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-10 20:24:49,647 INFO L280 TraceCheckUtils]: 20: Hoare triple {1572#(<= (+ main_~j~0 96) 0)} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-10 20:24:49,648 INFO L280 TraceCheckUtils]: 21: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-10 20:24:49,648 INFO L280 TraceCheckUtils]: 22: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-10 20:24:49,648 INFO L280 TraceCheckUtils]: 23: Hoare triple {1563#false} assume !!(~i~0 <= 100); {1563#false} is VALID [2020-07-10 20:24:49,648 INFO L280 TraceCheckUtils]: 24: Hoare triple {1563#false} ~i~0 := 1 + ~i~0; {1563#false} is VALID [2020-07-10 20:24:49,649 INFO L280 TraceCheckUtils]: 25: Hoare triple {1563#false} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-10 20:24:49,649 INFO L280 TraceCheckUtils]: 26: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-10 20:24:49,649 INFO L280 TraceCheckUtils]: 27: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-10 20:24:49,649 INFO L280 TraceCheckUtils]: 28: Hoare triple {1563#false} assume !(~i~0 <= 100); {1563#false} is VALID [2020-07-10 20:24:49,650 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-10 20:24:49,650 INFO L280 TraceCheckUtils]: 30: Hoare triple {1563#false} ~cond := #in~cond; {1563#false} is VALID [2020-07-10 20:24:49,650 INFO L280 TraceCheckUtils]: 31: Hoare triple {1563#false} assume 0 == ~cond; {1563#false} is VALID [2020-07-10 20:24:49,650 INFO L280 TraceCheckUtils]: 32: Hoare triple {1563#false} assume !false; {1563#false} is VALID [2020-07-10 20:24:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:49,652 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:49,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402854989] [2020-07-10 20:24:49,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:49,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:24:49,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457923881] [2020-07-10 20:24:49,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-10 20:24:49,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:49,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:24:49,699 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-10 20:24:49,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:24:49,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:24:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:24:49,700 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2020-07-10 20:24:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:50,078 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-10 20:24:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:24:50,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-10 20:24:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-10 20:24:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-10 20:24:50,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-10 20:24:50,131 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-10 20:24:50,133 INFO L225 Difference]: With dead ends: 56 [2020-07-10 20:24:50,134 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 20:24:50,134 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-10 20:24:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 20:24:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-10 20:24:50,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:50,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-10 20:24:50,189 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-10 20:24:50,189 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-10 20:24:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:50,193 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 20:24:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 20:24:50,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:50,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:50,194 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-10 20:24:50,194 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-10 20:24:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:50,196 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 20:24:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 20:24:50,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:50,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:50,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:50,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:24:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 20:24:50,202 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2020-07-10 20:24:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:50,202 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 20:24:50,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:24:50,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2020-07-10 20:24:50,250 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-10 20:24:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 20:24:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 20:24:50,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:50,252 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-10 20:24:50,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:24:50,252 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 377623979, now seen corresponding path program 6 times [2020-07-10 20:24:50,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:50,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374257235] [2020-07-10 20:24:50,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:50,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-10 20:24:50,441 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-10 20:24:50,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2020-07-10 20:24:50,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-10 20:24:50,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-10 20:24:50,442 INFO L263 TraceCheckUtils]: 3: Hoare triple {1855#true} call #t~ret0 := main(); {1855#true} is VALID [2020-07-10 20:24:50,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {1855#true} havoc ~i~0; {1855#true} is VALID [2020-07-10 20:24:50,442 INFO L280 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~j~0; {1855#true} is VALID [2020-07-10 20:24:50,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {1855#true} havoc ~k~0; {1855#true} is VALID [2020-07-10 20:24:50,443 INFO L280 TraceCheckUtils]: 7: Hoare triple {1855#true} ~i~0 := 0; {1859#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:50,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#(<= main_~i~0 0)} ~k~0 := 9; {1859#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:50,448 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-10 20:24:50,449 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-10 20:24:50,450 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-10 20:24:50,450 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-10 20:24:50,451 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-10 20:24:50,451 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-10 20:24:50,452 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-10 20:24:50,453 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-10 20:24:50,454 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-10 20:24:50,456 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-10 20:24:50,460 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-10 20:24:50,461 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-10 20:24:50,462 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-10 20:24:50,463 INFO L280 TraceCheckUtils]: 22: Hoare triple {1866#(<= (+ main_~j~0 95) 0)} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-10 20:24:50,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-10 20:24:50,464 INFO L280 TraceCheckUtils]: 24: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-10 20:24:50,464 INFO L280 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !!(~i~0 <= 100); {1856#false} is VALID [2020-07-10 20:24:50,464 INFO L280 TraceCheckUtils]: 26: Hoare triple {1856#false} ~i~0 := 1 + ~i~0; {1856#false} is VALID [2020-07-10 20:24:50,464 INFO L280 TraceCheckUtils]: 27: Hoare triple {1856#false} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-10 20:24:50,464 INFO L280 TraceCheckUtils]: 28: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-10 20:24:50,465 INFO L280 TraceCheckUtils]: 29: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-10 20:24:50,465 INFO L280 TraceCheckUtils]: 30: Hoare triple {1856#false} assume !(~i~0 <= 100); {1856#false} is VALID [2020-07-10 20:24:50,465 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-10 20:24:50,465 INFO L280 TraceCheckUtils]: 32: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2020-07-10 20:24:50,466 INFO L280 TraceCheckUtils]: 33: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2020-07-10 20:24:50,466 INFO L280 TraceCheckUtils]: 34: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2020-07-10 20:24:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:50,468 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:50,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374257235] [2020-07-10 20:24:50,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:50,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:24:50,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815737923] [2020-07-10 20:24:50,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-10 20:24:50,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:50,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:24:50,524 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-10 20:24:50,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:24:50,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:24:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:24:50,525 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-07-10 20:24:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:50,985 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-10 20:24:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:50,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-10 20:24:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-10 20:24:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-10 20:24:50,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-10 20:24:51,058 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-10 20:24:51,059 INFO L225 Difference]: With dead ends: 58 [2020-07-10 20:24:51,059 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 20:24:51,061 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-10 20:24:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 20:24:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-10 20:24:51,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:51,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-10 20:24:51,133 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-10 20:24:51,134 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-10 20:24:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,136 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 20:24:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 20:24:51,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:51,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:51,137 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-10 20:24:51,137 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-10 20:24:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,139 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 20:24:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 20:24:51,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:51,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:51,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:51,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 20:24:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-10 20:24:51,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2020-07-10 20:24:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:51,142 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-10 20:24:51,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:24:51,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2020-07-10 20:24:51,197 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-10 20:24:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-10 20:24:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:24:51,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:51,199 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-10 20:24:51,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:24:51,200 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 783824682, now seen corresponding path program 7 times [2020-07-10 20:24:51,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:51,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1396731202] [2020-07-10 20:24:51,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:51,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-10 20:24:51,391 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {2163#true} call ULTIMATE.init(); {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {2163#true} call #t~ret0 := main(); {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L280 TraceCheckUtils]: 4: Hoare triple {2163#true} havoc ~i~0; {2163#true} is VALID [2020-07-10 20:24:51,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {2163#true} havoc ~j~0; {2163#true} is VALID [2020-07-10 20:24:51,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {2163#true} havoc ~k~0; {2163#true} is VALID [2020-07-10 20:24:51,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {2163#true} ~i~0 := 0; {2167#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:51,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {2167#(<= main_~i~0 0)} ~k~0 := 9; {2167#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:51,395 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-10 20:24:51,396 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-10 20:24:51,399 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-10 20:24:51,402 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-10 20:24:51,404 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-10 20:24:51,404 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-10 20:24:51,405 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-10 20:24:51,406 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-10 20:24:51,407 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-10 20:24:51,408 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-10 20:24:51,409 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-10 20:24:51,409 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-10 20:24:51,410 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-10 20:24:51,412 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-10 20:24:51,416 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-10 20:24:51,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {2175#(<= (+ main_~j~0 94) 0)} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-10 20:24:51,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-10 20:24:51,418 INFO L280 TraceCheckUtils]: 26: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-10 20:24:51,418 INFO L280 TraceCheckUtils]: 27: Hoare triple {2164#false} assume !!(~i~0 <= 100); {2164#false} is VALID [2020-07-10 20:24:51,418 INFO L280 TraceCheckUtils]: 28: Hoare triple {2164#false} ~i~0 := 1 + ~i~0; {2164#false} is VALID [2020-07-10 20:24:51,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {2164#false} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-10 20:24:51,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-10 20:24:51,419 INFO L280 TraceCheckUtils]: 31: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-10 20:24:51,419 INFO L280 TraceCheckUtils]: 32: Hoare triple {2164#false} assume !(~i~0 <= 100); {2164#false} is VALID [2020-07-10 20:24:51,420 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-10 20:24:51,420 INFO L280 TraceCheckUtils]: 34: Hoare triple {2164#false} ~cond := #in~cond; {2164#false} is VALID [2020-07-10 20:24:51,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#false} assume 0 == ~cond; {2164#false} is VALID [2020-07-10 20:24:51,420 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#false} assume !false; {2164#false} is VALID [2020-07-10 20:24:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:51,422 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:51,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1396731202] [2020-07-10 20:24:51,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:51,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:24:51,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332085502] [2020-07-10 20:24:51,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 20:24:51,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:51,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:24:51,469 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-10 20:24:51,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:24:51,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:24:51,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:24:51,470 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 11 states. [2020-07-10 20:24:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:51,996 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-10 20:24:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:24:51,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-10 20:24:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 20:24:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:24:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 20:24:52,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-10 20:24:52,053 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-10 20:24:52,055 INFO L225 Difference]: With dead ends: 60 [2020-07-10 20:24:52,055 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 20:24:52,056 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-10 20:24:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 20:24:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-10 20:24:52,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:52,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-10 20:24:52,131 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-10 20:24:52,131 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-10 20:24:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,133 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 20:24:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 20:24:52,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,134 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-10 20:24:52,134 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-10 20:24:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,136 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 20:24:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-10 20:24:52,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:52,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 20:24:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-10 20:24:52,138 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2020-07-10 20:24:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:52,138 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-10 20:24:52,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:24:52,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-10 20:24:52,198 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-10 20:24:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-10 20:24:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 20:24:52,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:52,200 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-10 20:24:52,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:24:52,200 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash 300676329, now seen corresponding path program 8 times [2020-07-10 20:24:52,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:52,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1458234012] [2020-07-10 20:24:52,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-10 20:24:52,404 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-10 20:24:52,405 INFO L263 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2020-07-10 20:24:52,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-10 20:24:52,405 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-10 20:24:52,406 INFO L263 TraceCheckUtils]: 3: Hoare triple {2486#true} call #t~ret0 := main(); {2486#true} is VALID [2020-07-10 20:24:52,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {2486#true} havoc ~i~0; {2486#true} is VALID [2020-07-10 20:24:52,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~j~0; {2486#true} is VALID [2020-07-10 20:24:52,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {2486#true} havoc ~k~0; {2486#true} is VALID [2020-07-10 20:24:52,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {2486#true} ~i~0 := 0; {2490#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:52,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#(<= main_~i~0 0)} ~k~0 := 9; {2490#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:52,409 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-10 20:24:52,409 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-10 20:24:52,410 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-10 20:24:52,411 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-10 20:24:52,412 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-10 20:24:52,413 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-10 20:24:52,414 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-10 20:24:52,414 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-10 20:24:52,415 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-10 20:24:52,416 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-10 20:24:52,417 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-10 20:24:52,417 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-10 20:24:52,419 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-10 20:24:52,419 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-10 20:24:52,421 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-10 20:24:52,422 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-10 20:24:52,423 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-10 20:24:52,423 INFO L280 TraceCheckUtils]: 26: Hoare triple {2499#(<= (+ main_~j~0 93) 0)} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-10 20:24:52,424 INFO L280 TraceCheckUtils]: 27: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-10 20:24:52,424 INFO L280 TraceCheckUtils]: 28: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-10 20:24:52,424 INFO L280 TraceCheckUtils]: 29: Hoare triple {2487#false} assume !!(~i~0 <= 100); {2487#false} is VALID [2020-07-10 20:24:52,424 INFO L280 TraceCheckUtils]: 30: Hoare triple {2487#false} ~i~0 := 1 + ~i~0; {2487#false} is VALID [2020-07-10 20:24:52,425 INFO L280 TraceCheckUtils]: 31: Hoare triple {2487#false} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-10 20:24:52,425 INFO L280 TraceCheckUtils]: 32: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-10 20:24:52,425 INFO L280 TraceCheckUtils]: 33: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-10 20:24:52,425 INFO L280 TraceCheckUtils]: 34: Hoare triple {2487#false} assume !(~i~0 <= 100); {2487#false} is VALID [2020-07-10 20:24:52,426 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-10 20:24:52,426 INFO L280 TraceCheckUtils]: 36: Hoare triple {2487#false} ~cond := #in~cond; {2487#false} is VALID [2020-07-10 20:24:52,426 INFO L280 TraceCheckUtils]: 37: Hoare triple {2487#false} assume 0 == ~cond; {2487#false} is VALID [2020-07-10 20:24:52,427 INFO L280 TraceCheckUtils]: 38: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2020-07-10 20:24:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:52,430 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:52,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1458234012] [2020-07-10 20:24:52,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:52,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:24:52,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401379760] [2020-07-10 20:24:52,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-10 20:24:52,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:52,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:24:52,483 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-10 20:24:52,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:24:52,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:24:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:52,484 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2020-07-10 20:24:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,119 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-10 20:24:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:24:53,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-10 20:24:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-10 20:24:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-10 20:24:53,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-10 20:24:53,189 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-10 20:24:53,190 INFO L225 Difference]: With dead ends: 62 [2020-07-10 20:24:53,191 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 20:24:53,192 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-10 20:24:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 20:24:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-10 20:24:53,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:53,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-10 20:24:53,285 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-10 20:24:53,285 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-10 20:24:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,286 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-10 20:24:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 20:24:53,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:53,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:53,287 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-10 20:24:53,287 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-10 20:24:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,288 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-10 20:24:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 20:24:53,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:53,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:53,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:53,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 20:24:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-10 20:24:53,291 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2020-07-10 20:24:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:53,291 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-10 20:24:53,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:24:53,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2020-07-10 20:24:53,365 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-10 20:24:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 20:24:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:24:53,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:53,367 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-10 20:24:53,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:24:53,367 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash -148422936, now seen corresponding path program 9 times [2020-07-10 20:24:53,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:53,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830050610] [2020-07-10 20:24:53,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-10 20:24:53,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-10 20:24:53,598 INFO L263 TraceCheckUtils]: 0: Hoare triple {2824#true} call ULTIMATE.init(); {2824#true} is VALID [2020-07-10 20:24:53,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-10 20:24:53,599 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-10 20:24:53,599 INFO L263 TraceCheckUtils]: 3: Hoare triple {2824#true} call #t~ret0 := main(); {2824#true} is VALID [2020-07-10 20:24:53,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {2824#true} havoc ~i~0; {2824#true} is VALID [2020-07-10 20:24:53,600 INFO L280 TraceCheckUtils]: 5: Hoare triple {2824#true} havoc ~j~0; {2824#true} is VALID [2020-07-10 20:24:53,600 INFO L280 TraceCheckUtils]: 6: Hoare triple {2824#true} havoc ~k~0; {2824#true} is VALID [2020-07-10 20:24:53,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {2824#true} ~i~0 := 0; {2828#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:53,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {2828#(<= main_~i~0 0)} ~k~0 := 9; {2828#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:53,601 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-10 20:24:53,602 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-10 20:24:53,602 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-10 20:24:53,603 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-10 20:24:53,603 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-10 20:24:53,604 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-10 20:24:53,604 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-10 20:24:53,605 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-10 20:24:53,605 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-10 20:24:53,606 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-10 20:24:53,606 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-10 20:24:53,607 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-10 20:24:53,607 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-10 20:24:53,608 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-10 20:24:53,608 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-10 20:24:53,609 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-10 20:24:53,610 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-10 20:24:53,610 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-10 20:24:53,611 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-10 20:24:53,611 INFO L280 TraceCheckUtils]: 28: Hoare triple {2838#(<= (+ main_~j~0 92) 0)} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-10 20:24:53,612 INFO L280 TraceCheckUtils]: 29: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-10 20:24:53,612 INFO L280 TraceCheckUtils]: 30: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-10 20:24:53,612 INFO L280 TraceCheckUtils]: 31: Hoare triple {2825#false} assume !!(~i~0 <= 100); {2825#false} is VALID [2020-07-10 20:24:53,612 INFO L280 TraceCheckUtils]: 32: Hoare triple {2825#false} ~i~0 := 1 + ~i~0; {2825#false} is VALID [2020-07-10 20:24:53,613 INFO L280 TraceCheckUtils]: 33: Hoare triple {2825#false} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-10 20:24:53,613 INFO L280 TraceCheckUtils]: 34: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-10 20:24:53,613 INFO L280 TraceCheckUtils]: 35: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-10 20:24:53,613 INFO L280 TraceCheckUtils]: 36: Hoare triple {2825#false} assume !(~i~0 <= 100); {2825#false} is VALID [2020-07-10 20:24:53,613 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-10 20:24:53,613 INFO L280 TraceCheckUtils]: 38: Hoare triple {2825#false} ~cond := #in~cond; {2825#false} is VALID [2020-07-10 20:24:53,614 INFO L280 TraceCheckUtils]: 39: Hoare triple {2825#false} assume 0 == ~cond; {2825#false} is VALID [2020-07-10 20:24:53,614 INFO L280 TraceCheckUtils]: 40: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2020-07-10 20:24:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:53,616 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:53,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830050610] [2020-07-10 20:24:53,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:53,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:24:53,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516818174] [2020-07-10 20:24:53,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-10 20:24:53,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:53,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:24:53,664 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-10 20:24:53,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:24:53,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:24:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:53,665 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2020-07-10 20:24:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,365 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-10 20:24:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:24:54,365 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-10 20:24:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:24:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-10 20:24:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:24:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-10 20:24:54,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2020-07-10 20:24:54,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:54,434 INFO L225 Difference]: With dead ends: 64 [2020-07-10 20:24:54,434 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 20:24:54,435 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-10 20:24:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 20:24:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-10 20:24:54,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:54,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:54,556 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:54,556 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,557 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 20:24:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 20:24:54,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:54,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:54,557 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-10 20:24:54,557 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-10 20:24:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,558 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 20:24:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 20:24:54,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:54,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:54,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:54,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 20:24:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-10 20:24:54,560 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2020-07-10 20:24:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:54,561 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-10 20:24:54,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:24:54,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-10 20:24:54,639 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-10 20:24:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 20:24:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:24:54,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:54,641 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-10 20:24:54,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 20:24:54,641 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2058880295, now seen corresponding path program 10 times [2020-07-10 20:24:54,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:54,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377291688] [2020-07-10 20:24:54,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:54,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-10 20:24:54,759 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-10 20:24:54,759 INFO L263 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2020-07-10 20:24:54,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-10 20:24:54,759 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-10 20:24:54,760 INFO L263 TraceCheckUtils]: 3: Hoare triple {3177#true} call #t~ret0 := main(); {3177#true} is VALID [2020-07-10 20:24:54,760 INFO L280 TraceCheckUtils]: 4: Hoare triple {3177#true} havoc ~i~0; {3177#true} is VALID [2020-07-10 20:24:54,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~j~0; {3177#true} is VALID [2020-07-10 20:24:54,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {3177#true} havoc ~k~0; {3177#true} is VALID [2020-07-10 20:24:54,761 INFO L280 TraceCheckUtils]: 7: Hoare triple {3177#true} ~i~0 := 0; {3181#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:54,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {3181#(<= main_~i~0 0)} ~k~0 := 9; {3181#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:54,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {3181#(<= main_~i~0 0)} ~j~0 := -100; {3181#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:54,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {3181#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {3181#(<= main_~i~0 0)} is VALID [2020-07-10 20:24:54,763 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-10 20:24:54,764 INFO L280 TraceCheckUtils]: 12: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,765 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-10 20:24:54,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,766 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-10 20:24:54,766 INFO L280 TraceCheckUtils]: 16: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,767 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-10 20:24:54,772 INFO L280 TraceCheckUtils]: 18: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,773 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-10 20:24:54,774 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,774 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-10 20:24:54,774 INFO L280 TraceCheckUtils]: 22: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,775 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-10 20:24:54,775 INFO L280 TraceCheckUtils]: 24: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,776 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-10 20:24:54,776 INFO L280 TraceCheckUtils]: 26: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,776 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-10 20:24:54,777 INFO L280 TraceCheckUtils]: 28: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,777 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-10 20:24:54,783 INFO L280 TraceCheckUtils]: 30: Hoare triple {3182#(<= main_~i~0 1)} assume !(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,783 INFO L280 TraceCheckUtils]: 31: Hoare triple {3182#(<= main_~i~0 1)} ~k~0 := 4; {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,784 INFO L280 TraceCheckUtils]: 32: Hoare triple {3182#(<= main_~i~0 1)} assume !(~k~0 <= 3); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,784 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~i~0 <= 100); {3182#(<= main_~i~0 1)} is VALID [2020-07-10 20:24:54,785 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-10 20:24:54,785 INFO L280 TraceCheckUtils]: 35: Hoare triple {3183#(<= main_~i~0 2)} assume !(~j~0 < 20); {3183#(<= main_~i~0 2)} is VALID [2020-07-10 20:24:54,786 INFO L280 TraceCheckUtils]: 36: Hoare triple {3183#(<= main_~i~0 2)} ~k~0 := 4; {3183#(<= main_~i~0 2)} is VALID [2020-07-10 20:24:54,786 INFO L280 TraceCheckUtils]: 37: Hoare triple {3183#(<= main_~i~0 2)} assume !(~k~0 <= 3); {3183#(<= main_~i~0 2)} is VALID [2020-07-10 20:24:54,787 INFO L280 TraceCheckUtils]: 38: Hoare triple {3183#(<= main_~i~0 2)} assume !(~i~0 <= 100); {3178#false} is VALID [2020-07-10 20:24:54,787 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-10 20:24:54,787 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#false} ~cond := #in~cond; {3178#false} is VALID [2020-07-10 20:24:54,787 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#false} assume 0 == ~cond; {3178#false} is VALID [2020-07-10 20:24:54,787 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2020-07-10 20:24:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:54,789 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:54,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377291688] [2020-07-10 20:24:54,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:54,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:54,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605748932] [2020-07-10 20:24:54,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-10 20:24:54,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:54,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:54,818 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-10 20:24:54,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:54,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:54,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:54,819 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-10 20:24:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,005 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-10 20:24:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:24:55,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-10 20:24:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-10 20:24:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-10 20:24:55,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-10 20:24:55,062 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-10 20:24:55,063 INFO L225 Difference]: With dead ends: 60 [2020-07-10 20:24:55,063 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 20:24:55,064 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-10 20:24:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 20:24:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-10 20:24:55,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:55,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2020-07-10 20:24:55,182 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2020-07-10 20:24:55,182 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2020-07-10 20:24:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,184 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-10 20:24:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-10 20:24:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,185 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2020-07-10 20:24:55,185 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2020-07-10 20:24:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,187 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-10 20:24:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-10 20:24:55,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:55,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-10 20:24:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-10 20:24:55,190 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2020-07-10 20:24:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:55,190 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-10 20:24:55,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:55,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2020-07-10 20:24:55,280 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-10 20:24:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-10 20:24:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 20:24:55,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:55,281 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-10 20:24:55,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 20:24:55,282 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -135810616, now seen corresponding path program 11 times [2020-07-10 20:24:55,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:55,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [359082168] [2020-07-10 20:24:55,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:55,462 INFO L280 TraceCheckUtils]: 0: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-10 20:24:55,463 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-10 20:24:55,463 INFO L263 TraceCheckUtils]: 0: Hoare triple {3524#true} call ULTIMATE.init(); {3524#true} is VALID [2020-07-10 20:24:55,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-10 20:24:55,463 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-10 20:24:55,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {3524#true} call #t~ret0 := main(); {3524#true} is VALID [2020-07-10 20:24:55,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {3524#true} havoc ~i~0; {3524#true} is VALID [2020-07-10 20:24:55,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {3524#true} havoc ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {3524#true} havoc ~k~0; {3524#true} is VALID [2020-07-10 20:24:55,464 INFO L280 TraceCheckUtils]: 7: Hoare triple {3524#true} ~i~0 := 0; {3524#true} is VALID [2020-07-10 20:24:55,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {3524#true} ~k~0 := 9; {3524#true} is VALID [2020-07-10 20:24:55,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {3524#true} ~j~0 := -100; {3524#true} is VALID [2020-07-10 20:24:55,465 INFO L280 TraceCheckUtils]: 10: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-10 20:24:55,465 INFO L280 TraceCheckUtils]: 11: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-10 20:24:55,465 INFO L280 TraceCheckUtils]: 12: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,465 INFO L280 TraceCheckUtils]: 13: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,466 INFO L280 TraceCheckUtils]: 14: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,466 INFO L280 TraceCheckUtils]: 15: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,466 INFO L280 TraceCheckUtils]: 16: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,466 INFO L280 TraceCheckUtils]: 18: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,467 INFO L280 TraceCheckUtils]: 19: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,468 INFO L280 TraceCheckUtils]: 28: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-10 20:24:55,469 INFO L280 TraceCheckUtils]: 30: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,469 INFO L280 TraceCheckUtils]: 31: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-10 20:24:55,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-10 20:24:55,469 INFO L280 TraceCheckUtils]: 33: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-10 20:24:55,470 INFO L280 TraceCheckUtils]: 34: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-10 20:24:55,470 INFO L280 TraceCheckUtils]: 35: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,470 INFO L280 TraceCheckUtils]: 36: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-10 20:24:55,470 INFO L280 TraceCheckUtils]: 37: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-10 20:24:55,470 INFO L280 TraceCheckUtils]: 38: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-10 20:24:55,471 INFO L280 TraceCheckUtils]: 39: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-10 20:24:55,471 INFO L280 TraceCheckUtils]: 40: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-10 20:24:55,472 INFO L280 TraceCheckUtils]: 41: Hoare triple {3524#true} ~k~0 := 4; {3528#(= 4 main_~k~0)} is VALID [2020-07-10 20:24:55,473 INFO L280 TraceCheckUtils]: 42: Hoare triple {3528#(= 4 main_~k~0)} assume !(~k~0 <= 3); {3528#(= 4 main_~k~0)} is VALID [2020-07-10 20:24:55,475 INFO L280 TraceCheckUtils]: 43: Hoare triple {3528#(= 4 main_~k~0)} assume !(~i~0 <= 100); {3528#(= 4 main_~k~0)} is VALID [2020-07-10 20:24:55,476 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-10 20:24:55,478 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-10 20:24:55,478 INFO L280 TraceCheckUtils]: 46: Hoare triple {3530#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3525#false} is VALID [2020-07-10 20:24:55,479 INFO L280 TraceCheckUtils]: 47: Hoare triple {3525#false} assume !false; {3525#false} is VALID [2020-07-10 20:24:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:24:55,480 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:55,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [359082168] [2020-07-10 20:24:55,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:55,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:24:55,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695757902] [2020-07-10 20:24:55,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-10 20:24:55,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:55,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:24:55,511 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-10 20:24:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:24:55,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:24:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:24:55,512 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-10 20:24:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,729 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-07-10 20:24:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:24:55,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-10 20:24:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 20:24:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:24:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-10 20:24:55,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-10 20:24:55,784 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-10 20:24:55,784 INFO L225 Difference]: With dead ends: 71 [2020-07-10 20:24:55,784 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:55,785 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-10 20:24:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:55,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:55,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:55,786 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:55,786 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,787 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:55,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,788 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:55,788 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,788 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:55,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:55,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:55,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-10 20:24:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:55,790 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:55,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:24:55,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:55,790 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-10 20:24:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:55,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 20:24:55,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:56,142 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,142 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,143 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:56,143 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:56,143 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:56,144 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:24:56,144 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:24:56,144 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:56,144 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-07-10 20:24:56,144 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 30) the Hoare annotation is: true [2020-07-10 20:24:56,144 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-10 20:24:56,145 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-10 20:24:56,145 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= main_~i~0 0) [2020-07-10 20:24:56,145 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:24:56,145 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 30) the Hoare annotation is: true [2020-07-10 20:24:56,145 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-10 20:24:56,145 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-10 20:24:56,146 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-10 20:24:56,146 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-10 20:24:56,146 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-10 20:24:56,146 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-10 20:24:56,146 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= main_~i~0 0) [2020-07-10 20:24:56,146 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-10 20:24:56,147 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:24:56,147 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-10 20:24:56,147 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:56,147 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:56,147 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:56,147 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-10 20:24:56,147 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:56,148 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:56,153 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:56,155 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:56,155 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:56,156 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:24:56,156 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:24:56,164 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-10 20:24:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:56 BoogieIcfgContainer [2020-07-10 20:24:56,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:56,181 INFO L168 Benchmark]: Toolchain (without parser) took 19758.03 ms. Allocated memory was 134.7 MB in the beginning and 343.4 MB in the end (delta: 208.7 MB). Free memory was 100.4 MB in the beginning and 168.2 MB in the end (delta: -67.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,181 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.31 ms. Allocated memory is still 134.7 MB. Free memory was 100.1 MB in the beginning and 90.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,182 INFO L168 Benchmark]: Boogie Preprocessor took 35.12 ms. Allocated memory is still 134.7 MB. Free memory was 90.5 MB in the beginning and 88.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,183 INFO L168 Benchmark]: RCFGBuilder took 417.52 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 88.9 MB in the beginning and 161.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,184 INFO L168 Benchmark]: TraceAbstraction took 19059.21 ms. Allocated memory was 199.8 MB in the beginning and 343.4 MB in the end (delta: 143.7 MB). Free memory was 161.7 MB in the beginning and 168.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 137.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:56,186 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.93 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 239.31 ms. Allocated memory is still 134.7 MB. Free memory was 100.1 MB in the beginning and 90.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.12 ms. Allocated memory is still 134.7 MB. Free memory was 90.5 MB in the beginning and 88.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.52 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 88.9 MB in the beginning and 161.7 MB in the end (delta: -72.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19059.21 ms. Allocated memory was 199.8 MB in the beginning and 343.4 MB in the end (delta: 143.7 MB). Free memory was 161.7 MB in the beginning and 168.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 137.1 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.8s 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...