/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:34:18,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:34:18,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:34:18,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:34:18,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:34:18,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:34:18,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:34:18,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:34:18,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:34:18,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:34:18,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:34:18,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:34:18,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:34:18,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:34:18,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:34:18,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:34:18,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:34:18,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:34:18,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:34:18,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:34:18,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:34:18,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:34:18,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:34:18,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:34:18,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:34:18,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:34:18,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:34:18,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:34:18,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:34:18,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:34:18,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:34:18,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:34:18,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:34:18,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:34:18,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:34:18,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:34:18,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:34:18,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:34:18,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:34:18,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:34:18,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:34:18,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:34:18,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:34:18,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:34:18,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:34:18,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:34:18,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:34:18,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:34:18,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:34:18,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:34:18,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:34:18,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:34:18,180 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:34:18,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:34:18,181 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:34:18,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:34:18,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:34:18,182 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:34:18,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:34:18,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:34:18,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:34:18,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:34:18,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:34:18,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:34:18,184 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:34:18,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:34:18,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:34:18,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:34:18,544 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:34:18,545 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:34:18,546 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-18 06:34:18,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855850a2b/1a84f68c25584ce79f665a4e9fc9360c/FLAG454d448df [2020-07-18 06:34:19,196 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:34:19,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-18 06:34:19,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855850a2b/1a84f68c25584ce79f665a4e9fc9360c/FLAG454d448df [2020-07-18 06:34:19,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855850a2b/1a84f68c25584ce79f665a4e9fc9360c [2020-07-18 06:34:19,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:34:19,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:34:19,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:19,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:34:19,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:34:19,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f2ddd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19, skipping insertion in model container [2020-07-18 06:34:19,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:34:19,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:34:19,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:19,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:34:19,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:19,918 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:34:19,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19 WrapperNode [2020-07-18 06:34:19,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:19,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:34:19,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:34:19,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:34:19,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (1/1) ... [2020-07-18 06:34:19,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:34:19,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:34:19,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:34:19,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:34:19,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (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-18 06:34:20,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:34:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:34:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:34:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:34:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:34:20,447 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:34:20,448 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:34:20,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:20 BoogieIcfgContainer [2020-07-18 06:34:20,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:34:20,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:34:20,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:34:20,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:34:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:34:19" (1/3) ... [2020-07-18 06:34:20,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:20, skipping insertion in model container [2020-07-18 06:34:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:19" (2/3) ... [2020-07-18 06:34:20,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452a135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:20, skipping insertion in model container [2020-07-18 06:34:20,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:20" (3/3) ... [2020-07-18 06:34:20,464 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2020-07-18 06:34:20,479 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:34:20,498 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:34:20,511 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:34:20,541 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:34:20,541 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:34:20,541 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:34:20,541 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:34:20,542 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:34:20,543 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:34:20,544 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:34:20,544 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:34:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-18 06:34:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:34:20,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:20,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:20,574 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -290415040, now seen corresponding path program 1 times [2020-07-18 06:34:20,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:20,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [161781521] [2020-07-18 06:34:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:20,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 06:34:20,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-18 06:34:20,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-18 06:34:20,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 06:34:20,752 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-18 06:34:20,752 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-18 06:34:20,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} havoc ~i~0; {30#true} is VALID [2020-07-18 06:34:20,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {30#true} is VALID [2020-07-18 06:34:20,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} havoc #t~nondet0; {30#true} is VALID [2020-07-18 06:34:20,754 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~sn~0 := 0; {30#true} is VALID [2020-07-18 06:34:20,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~i~0 := 1; {30#true} is VALID [2020-07-18 06:34:20,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#true} assume !true; {31#false} is VALID [2020-07-18 06:34:20,762 INFO L263 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {31#false} is VALID [2020-07-18 06:34:20,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2020-07-18 06:34:20,762 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2020-07-18 06:34:20,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-18 06:34:20,764 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-18 06:34:20,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [161781521] [2020-07-18 06:34:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:20,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:34:20,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369914046] [2020-07-18 06:34:20,775 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:34:20,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:20,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:34:20,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:20,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:34:20,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:34:20,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:34:20,850 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2020-07-18 06:34:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,979 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-18 06:34:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:34:20,979 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:34:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-18 06:34:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-18 06:34:20,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2020-07-18 06:34:21,088 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-18 06:34:21,102 INFO L225 Difference]: With dead ends: 38 [2020-07-18 06:34:21,102 INFO L226 Difference]: Without dead ends: 21 [2020-07-18 06:34:21,107 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-18 06:34:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-18 06:34:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-18 06:34:21,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:21,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-18 06:34:21,176 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-18 06:34:21,176 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-18 06:34:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:21,181 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-18 06:34:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-18 06:34:21,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:21,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:21,183 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-18 06:34:21,184 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-18 06:34:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:21,188 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-18 06:34:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-18 06:34:21,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:21,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:21,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:21,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-18 06:34:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-18 06:34:21,196 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2020-07-18 06:34:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:21,197 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-18 06:34:21,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:34:21,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2020-07-18 06:34:21,241 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-18 06:34:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-18 06:34:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:34:21,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:21,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:21,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:34:21,244 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash -304267855, now seen corresponding path program 1 times [2020-07-18 06:34:21,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:21,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854860093] [2020-07-18 06:34:21,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,380 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-18 06:34:21,381 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-18 06:34:21,382 INFO L263 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2020-07-18 06:34:21,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-18 06:34:21,382 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-18 06:34:21,383 INFO L263 TraceCheckUtils]: 3: Hoare triple {196#true} call #t~ret2 := main(); {196#true} is VALID [2020-07-18 06:34:21,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {196#true} havoc ~i~0; {196#true} is VALID [2020-07-18 06:34:21,384 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {196#true} is VALID [2020-07-18 06:34:21,384 INFO L280 TraceCheckUtils]: 6: Hoare triple {196#true} havoc #t~nondet0; {196#true} is VALID [2020-07-18 06:34:21,385 INFO L280 TraceCheckUtils]: 7: Hoare triple {196#true} ~sn~0 := 0; {200#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:21,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#(= 0 main_~sn~0)} ~i~0 := 1; {200#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:21,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {200#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:21,390 INFO L263 TraceCheckUtils]: 10: Hoare triple {200#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:21,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {202#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:21,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {197#false} is VALID [2020-07-18 06:34:21,393 INFO L280 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2020-07-18 06:34:21,395 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-18 06:34:21,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854860093] [2020-07-18 06:34:21,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:21,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:34:21,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681151052] [2020-07-18 06:34:21,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:34:21,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:21,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:21,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:21,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:21,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:21,427 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2020-07-18 06:34:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:21,600 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 06:34:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:34:21,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:34:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-18 06:34:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-18 06:34:21,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-18 06:34:21,653 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-18 06:34:21,656 INFO L225 Difference]: With dead ends: 28 [2020-07-18 06:34:21,656 INFO L226 Difference]: Without dead ends: 23 [2020-07-18 06:34:21,657 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-18 06:34:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-18 06:34:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-18 06:34:21,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:21,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-18 06:34:21,691 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-18 06:34:21,691 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-18 06:34:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:21,694 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 06:34:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 06:34:21,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:21,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:21,695 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-18 06:34:21,695 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-18 06:34:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:21,698 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-18 06:34:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-18 06:34:21,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:21,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:21,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:21,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-18 06:34:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-18 06:34:21,702 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2020-07-18 06:34:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:21,702 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-18 06:34:21,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:21,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2020-07-18 06:34:21,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-18 06:34:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 06:34:21,737 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:21,737 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-18 06:34:21,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:34:21,737 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash -887516915, now seen corresponding path program 1 times [2020-07-18 06:34:21,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:21,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780999293] [2020-07-18 06:34:21,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:22,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-18 06:34:22,185 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-18 06:34:22,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-18 06:34:22,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-18 06:34:22,186 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-18 06:34:22,186 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret2 := main(); {353#true} is VALID [2020-07-18 06:34:22,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {353#true} havoc ~i~0; {353#true} is VALID [2020-07-18 06:34:22,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {353#true} is VALID [2020-07-18 06:34:22,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} havoc #t~nondet0; {353#true} is VALID [2020-07-18 06:34:22,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} ~sn~0 := 0; {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:22,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:22,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:22,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:22,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:22,197 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {361#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:22,198 INFO L280 TraceCheckUtils]: 13: Hoare triple {361#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {362#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:22,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {362#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {362#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:22,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {362#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {363#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:22,206 INFO L263 TraceCheckUtils]: 16: Hoare triple {363#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:22,208 INFO L280 TraceCheckUtils]: 17: Hoare triple {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {365#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:22,212 INFO L280 TraceCheckUtils]: 18: Hoare triple {365#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {354#false} is VALID [2020-07-18 06:34:22,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-18 06:34:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:22,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780999293] [2020-07-18 06:34:22,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:22,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:34:22,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316035877] [2020-07-18 06:34:22,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-18 06:34:22,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:22,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:34:22,258 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-18 06:34:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:34:22,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:34:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:22,259 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2020-07-18 06:34:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,990 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 06:34:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:34:22,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-18 06:34:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-18 06:34:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-18 06:34:22,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2020-07-18 06:34:23,044 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-18 06:34:23,047 INFO L225 Difference]: With dead ends: 35 [2020-07-18 06:34:23,047 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 06:34:23,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:34:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 06:34:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-18 06:34:23,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:23,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-18 06:34:23,118 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-18 06:34:23,119 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-18 06:34:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:23,127 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-18 06:34:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-18 06:34:23,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:23,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:23,128 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-18 06:34:23,128 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-18 06:34:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:23,134 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-18 06:34:23,134 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-18 06:34:23,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:23,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:23,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:23,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 06:34:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 06:34:23,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2020-07-18 06:34:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:23,143 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 06:34:23,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:34:23,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 06:34:23,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 06:34:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-18 06:34:23,195 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:23,195 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] [2020-07-18 06:34:23,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:34:23,196 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -507920327, now seen corresponding path program 1 times [2020-07-18 06:34:23,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:23,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674363102] [2020-07-18 06:34:23,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:23,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-18 06:34:23,256 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-18 06:34:23,256 INFO L263 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {564#true} is VALID [2020-07-18 06:34:23,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-18 06:34:23,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-18 06:34:23,257 INFO L263 TraceCheckUtils]: 3: Hoare triple {564#true} call #t~ret2 := main(); {564#true} is VALID [2020-07-18 06:34:23,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#true} havoc ~i~0; {564#true} is VALID [2020-07-18 06:34:23,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {564#true} is VALID [2020-07-18 06:34:23,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#true} havoc #t~nondet0; {564#true} is VALID [2020-07-18 06:34:23,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#true} ~sn~0 := 0; {564#true} is VALID [2020-07-18 06:34:23,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {564#true} ~i~0 := 1; {568#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:23,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {568#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {568#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:23,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {568#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {568#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:23,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {568#(<= main_~i~0 1)} assume 4 == ~i~0; {565#false} is VALID [2020-07-18 06:34:23,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {565#false} ~sn~0 := -10; {565#false} is VALID [2020-07-18 06:34:23,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {565#false} #t~post1 := ~i~0; {565#false} is VALID [2020-07-18 06:34:23,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#false} ~i~0 := 1 + #t~post1; {565#false} is VALID [2020-07-18 06:34:23,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {565#false} havoc #t~post1; {565#false} is VALID [2020-07-18 06:34:23,264 INFO L280 TraceCheckUtils]: 16: Hoare triple {565#false} assume !(~i~0 <= ~n~0); {565#false} is VALID [2020-07-18 06:34:23,264 INFO L263 TraceCheckUtils]: 17: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2020-07-18 06:34:23,265 INFO L280 TraceCheckUtils]: 18: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2020-07-18 06:34:23,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2020-07-18 06:34:23,265 INFO L280 TraceCheckUtils]: 20: Hoare triple {565#false} assume !false; {565#false} is VALID [2020-07-18 06:34:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:23,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674363102] [2020-07-18 06:34:23,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:23,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:34:23,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477520503] [2020-07-18 06:34:23,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-18 06:34:23,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:23,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:34:23,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:23,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:34:23,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:23,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:34:23,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:34:23,296 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2020-07-18 06:34:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:23,400 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-18 06:34:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:34:23,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-18 06:34:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:34:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-18 06:34:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:34:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-18 06:34:23,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2020-07-18 06:34:23,454 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-18 06:34:23,455 INFO L225 Difference]: With dead ends: 40 [2020-07-18 06:34:23,456 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 06:34:23,456 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-18 06:34:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 06:34:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 06:34:23,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:23,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 06:34:23,494 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 06:34:23,494 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 06:34:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:23,496 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 06:34:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 06:34:23,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:23,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:23,497 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 06:34:23,498 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 06:34:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:23,500 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-18 06:34:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 06:34:23,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:23,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:23,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:23,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 06:34:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-18 06:34:23,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2020-07-18 06:34:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:23,504 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-18 06:34:23,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:34:23,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-18 06:34:23,551 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-18 06:34:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 06:34:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 06:34:23,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:23,553 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:23,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:34:23,554 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1934159721, now seen corresponding path program 2 times [2020-07-18 06:34:23,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:23,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1766615024] [2020-07-18 06:34:23,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:24,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-18 06:34:24,052 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {763#true} {763#true} #45#return; {763#true} is VALID [2020-07-18 06:34:24,053 INFO L263 TraceCheckUtils]: 0: Hoare triple {763#true} call ULTIMATE.init(); {763#true} is VALID [2020-07-18 06:34:24,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-18 06:34:24,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {763#true} {763#true} #45#return; {763#true} is VALID [2020-07-18 06:34:24,054 INFO L263 TraceCheckUtils]: 3: Hoare triple {763#true} call #t~ret2 := main(); {763#true} is VALID [2020-07-18 06:34:24,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {763#true} havoc ~i~0; {763#true} is VALID [2020-07-18 06:34:24,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {763#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {763#true} is VALID [2020-07-18 06:34:24,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {763#true} havoc #t~nondet0; {763#true} is VALID [2020-07-18 06:34:24,057 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#true} ~sn~0 := 0; {767#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:24,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {767#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:24,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:24,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:24,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} assume !(4 == ~i~0); {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:24,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {770#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-18 06:34:24,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {770#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:24,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:24,066 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {771#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:24,067 INFO L280 TraceCheckUtils]: 16: Hoare triple {771#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {772#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:24,069 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {772#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:24,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {773#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:24,071 INFO L280 TraceCheckUtils]: 19: Hoare triple {773#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {774#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:24,072 INFO L280 TraceCheckUtils]: 20: Hoare triple {774#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {774#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:24,073 INFO L280 TraceCheckUtils]: 21: Hoare triple {774#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {775#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:24,074 INFO L263 TraceCheckUtils]: 22: Hoare triple {775#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {776#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:24,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {776#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {777#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:24,076 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {764#false} is VALID [2020-07-18 06:34:24,076 INFO L280 TraceCheckUtils]: 25: Hoare triple {764#false} assume !false; {764#false} is VALID [2020-07-18 06:34:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:34:24,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1766615024] [2020-07-18 06:34:24,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:24,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:24,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188751216] [2020-07-18 06:34:24,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:34:24,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:24,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:24,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:24,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:24,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:24,122 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-18 06:34:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:24,899 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-18 06:34:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 06:34:24,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:34:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-18 06:34:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-18 06:34:24,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2020-07-18 06:34:24,943 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-18 06:34:24,945 INFO L225 Difference]: With dead ends: 40 [2020-07-18 06:34:24,945 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 06:34:24,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-18 06:34:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 06:34:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-18 06:34:25,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:25,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-18 06:34:25,005 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-18 06:34:25,005 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-18 06:34:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,007 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 06:34:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 06:34:25,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:25,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:25,011 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-18 06:34:25,011 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-18 06:34:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,014 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 06:34:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 06:34:25,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:25,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:25,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:25,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 06:34:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-18 06:34:25,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2020-07-18 06:34:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:25,024 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-18 06:34:25,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:25,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-18 06:34:25,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-18 06:34:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 06:34:25,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:25,072 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-18 06:34:25,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:34:25,072 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1064709469, now seen corresponding path program 1 times [2020-07-18 06:34:25,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:25,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107863701] [2020-07-18 06:34:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:25,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-18 06:34:25,137 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1008#true} {1008#true} #45#return; {1008#true} is VALID [2020-07-18 06:34:25,137 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-18 06:34:25,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-18 06:34:25,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #45#return; {1008#true} is VALID [2020-07-18 06:34:25,138 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret2 := main(); {1008#true} is VALID [2020-07-18 06:34:25,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0; {1008#true} is VALID [2020-07-18 06:34:25,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {1008#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1008#true} is VALID [2020-07-18 06:34:25,139 INFO L280 TraceCheckUtils]: 6: Hoare triple {1008#true} havoc #t~nondet0; {1008#true} is VALID [2020-07-18 06:34:25,139 INFO L280 TraceCheckUtils]: 7: Hoare triple {1008#true} ~sn~0 := 0; {1008#true} is VALID [2020-07-18 06:34:25,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {1008#true} ~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1012#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {1012#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {1012#(<= main_~i~0 1)} assume !(4 == ~i~0); {1012#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,144 INFO L280 TraceCheckUtils]: 12: Hoare triple {1012#(<= main_~i~0 1)} #t~post1 := ~i~0; {1013#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:25,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {1013#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1014#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 2)} havoc #t~post1; {1014#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {1014#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1014#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,147 INFO L280 TraceCheckUtils]: 16: Hoare triple {1014#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {1014#(<= main_~i~0 2)} assume 4 == ~i~0; {1009#false} is VALID [2020-07-18 06:34:25,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#false} ~sn~0 := -10; {1009#false} is VALID [2020-07-18 06:34:25,148 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} #t~post1 := ~i~0; {1009#false} is VALID [2020-07-18 06:34:25,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} ~i~0 := 1 + #t~post1; {1009#false} is VALID [2020-07-18 06:34:25,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} havoc #t~post1; {1009#false} is VALID [2020-07-18 06:34:25,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {1009#false} assume !(~i~0 <= ~n~0); {1009#false} is VALID [2020-07-18 06:34:25,149 INFO L263 TraceCheckUtils]: 23: Hoare triple {1009#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-18 06:34:25,150 INFO L280 TraceCheckUtils]: 24: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-18 06:34:25,150 INFO L280 TraceCheckUtils]: 25: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-18 06:34:25,150 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-18 06:34:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:25,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107863701] [2020-07-18 06:34:25,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:25,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 06:34:25,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462547193] [2020-07-18 06:34:25,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:34:25,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:25,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:25,183 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-18 06:34:25,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:25,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:25,184 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2020-07-18 06:34:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,376 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-18 06:34:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:34:25,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:34:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-18 06:34:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-18 06:34:25,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-18 06:34:25,436 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-18 06:34:25,438 INFO L225 Difference]: With dead ends: 50 [2020-07-18 06:34:25,438 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 06:34:25,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:34:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 06:34:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-18 06:34:25,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:25,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-18 06:34:25,509 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-18 06:34:25,509 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-18 06:34:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,512 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-18 06:34:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-18 06:34:25,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:25,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:25,513 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-18 06:34:25,513 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-18 06:34:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,516 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-18 06:34:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-18 06:34:25,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:25,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:25,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:25,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 06:34:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-18 06:34:25,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2020-07-18 06:34:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:25,520 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-18 06:34:25,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:25,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2020-07-18 06:34:25,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-18 06:34:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 06:34:25,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:25,582 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:25,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:34:25,583 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash -674418815, now seen corresponding path program 2 times [2020-07-18 06:34:25,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:25,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473867432] [2020-07-18 06:34:25,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:25,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {1269#true} assume true; {1269#true} is VALID [2020-07-18 06:34:25,664 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1269#true} {1269#true} #45#return; {1269#true} is VALID [2020-07-18 06:34:25,665 INFO L263 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2020-07-18 06:34:25,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {1269#true} assume true; {1269#true} is VALID [2020-07-18 06:34:25,665 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1269#true} {1269#true} #45#return; {1269#true} is VALID [2020-07-18 06:34:25,665 INFO L263 TraceCheckUtils]: 3: Hoare triple {1269#true} call #t~ret2 := main(); {1269#true} is VALID [2020-07-18 06:34:25,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {1269#true} havoc ~i~0; {1269#true} is VALID [2020-07-18 06:34:25,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {1269#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1269#true} is VALID [2020-07-18 06:34:25,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {1269#true} havoc #t~nondet0; {1269#true} is VALID [2020-07-18 06:34:25,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {1269#true} ~sn~0 := 0; {1269#true} is VALID [2020-07-18 06:34:25,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {1269#true} ~i~0 := 1; {1273#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {1273#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1273#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,669 INFO L280 TraceCheckUtils]: 10: Hoare triple {1273#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1273#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {1273#(<= main_~i~0 1)} assume !(4 == ~i~0); {1273#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:25,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {1273#(<= main_~i~0 1)} #t~post1 := ~i~0; {1274#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:25,672 INFO L280 TraceCheckUtils]: 13: Hoare triple {1274#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1275#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {1275#(<= main_~i~0 2)} havoc #t~post1; {1275#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {1275#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1275#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {1275#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1275#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {1275#(<= main_~i~0 2)} assume !(4 == ~i~0); {1275#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:25,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {1275#(<= main_~i~0 2)} #t~post1 := ~i~0; {1276#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:25,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1277#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:25,677 INFO L280 TraceCheckUtils]: 20: Hoare triple {1277#(<= main_~i~0 3)} havoc #t~post1; {1277#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:25,678 INFO L280 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1277#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:25,678 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1277#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:25,679 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#(<= main_~i~0 3)} assume 4 == ~i~0; {1270#false} is VALID [2020-07-18 06:34:25,680 INFO L280 TraceCheckUtils]: 24: Hoare triple {1270#false} ~sn~0 := -10; {1270#false} is VALID [2020-07-18 06:34:25,680 INFO L280 TraceCheckUtils]: 25: Hoare triple {1270#false} #t~post1 := ~i~0; {1270#false} is VALID [2020-07-18 06:34:25,680 INFO L280 TraceCheckUtils]: 26: Hoare triple {1270#false} ~i~0 := 1 + #t~post1; {1270#false} is VALID [2020-07-18 06:34:25,681 INFO L280 TraceCheckUtils]: 27: Hoare triple {1270#false} havoc #t~post1; {1270#false} is VALID [2020-07-18 06:34:25,681 INFO L280 TraceCheckUtils]: 28: Hoare triple {1270#false} assume !(~i~0 <= ~n~0); {1270#false} is VALID [2020-07-18 06:34:25,681 INFO L263 TraceCheckUtils]: 29: Hoare triple {1270#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1270#false} is VALID [2020-07-18 06:34:25,681 INFO L280 TraceCheckUtils]: 30: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2020-07-18 06:34:25,682 INFO L280 TraceCheckUtils]: 31: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2020-07-18 06:34:25,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2020-07-18 06:34:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:25,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473867432] [2020-07-18 06:34:25,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:25,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:34:25,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680063381] [2020-07-18 06:34:25,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 06:34:25,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:25,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:34:25,719 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-18 06:34:25,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:34:25,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:25,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:34:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:34:25,721 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 7 states. [2020-07-18 06:34:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:25,978 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2020-07-18 06:34:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:34:25,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-18 06:34:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-18 06:34:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-18 06:34:25,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-18 06:34:26,044 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-18 06:34:26,047 INFO L225 Difference]: With dead ends: 56 [2020-07-18 06:34:26,047 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 06:34:26,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 06:34:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 06:34:26,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:26,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 06:34:26,152 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 06:34:26,153 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 06:34:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:26,156 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 06:34:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 06:34:26,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:26,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:26,157 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 06:34:26,158 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 06:34:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:26,161 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 06:34:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 06:34:26,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:26,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:26,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:26,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 06:34:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-18 06:34:26,164 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2020-07-18 06:34:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:26,165 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-18 06:34:26,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:34:26,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-18 06:34:26,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-18 06:34:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 06:34:26,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:26,250 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:26,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:34:26,250 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -809826651, now seen corresponding path program 3 times [2020-07-18 06:34:26,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:26,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219556359] [2020-07-18 06:34:26,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:26,337 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:34:26,337 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:34:26,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:34:26,373 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:34:26,373 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:26,373 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:26,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:26,375 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:26,376 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 06:34:26,377 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 06:34:26,378 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-18 06:34:26,378 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:34:26,378 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-18 06:34:26,378 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-18 06:34:26,378 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:34:26,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:34:26 BoogieIcfgContainer [2020-07-18 06:34:26,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:34:26,388 INFO L168 Benchmark]: Toolchain (without parser) took 6825.04 ms. Allocated memory was 141.6 MB in the beginning and 296.7 MB in the end (delta: 155.2 MB). Free memory was 99.9 MB in the beginning and 102.2 MB in the end (delta: -2.2 MB). Peak memory consumption was 153.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,389 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.43 ms. Allocated memory is still 141.6 MB. Free memory was 99.5 MB in the beginning and 89.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,391 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 141.6 MB. Free memory was 89.5 MB in the beginning and 88.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,392 INFO L168 Benchmark]: RCFGBuilder took 495.53 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 87.9 MB in the beginning and 162.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,393 INFO L168 Benchmark]: TraceAbstraction took 5928.82 ms. Allocated memory was 198.7 MB in the beginning and 296.7 MB in the end (delta: 98.0 MB). Free memory was 162.0 MB in the beginning and 102.2 MB in the end (delta: 59.8 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:26,397 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 1.18 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.43 ms. Allocated memory is still 141.6 MB. Free memory was 99.5 MB in the beginning and 89.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 141.6 MB. Free memory was 89.5 MB in the beginning and 88.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 495.53 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 87.9 MB in the beginning and 162.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5928.82 ms. Allocated memory was 198.7 MB in the beginning and 296.7 MB in the end (delta: 98.0 MB). Free memory was 162.0 MB in the beginning and 102.2 MB in the end (delta: 59.8 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [__VERIFIER_nondet_uint()=4, n=4] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [n=0, n=4] [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n VAL [i=1, n=4, n=0] [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=4, n=2] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n VAL [i=2, n=4, n=2] [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=4] [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n VAL [i=4, n=4, n=6] [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 VAL [i=4, n=4, n=8] [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=4, n=-10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 131 SDtfs, 32 SDslu, 379 SDs, 0 SdLazy, 310 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 12824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 16/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...