/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/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:32:37,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:32:37,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:32:37,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:32:37,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:32:37,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:32:37,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:32:37,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:32:37,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:32:37,153 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:32:37,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:32:37,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:32:37,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:32:37,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:32:37,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:32:37,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:32:37,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:32:37,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:32:37,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:32:37,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:32:37,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:32:37,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:32:37,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:32:37,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:32:37,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:32:37,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:32:37,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:32:37,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:32:37,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:32:37,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:32:37,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:32:37,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:32:37,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:32:37,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:32:37,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:32:37,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:32:37,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:32:37,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:32:37,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:32:37,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:32:37,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:32:37,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:32:37,227 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:32:37,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:32:37,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:32:37,232 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:32:37,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:32:37,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:32:37,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:32:37,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:32:37,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:32:37,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:32:37,234 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:32:37,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:32:37,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:32:37,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:32:37,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:32:37,235 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:32:37,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:32:37,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:32:37,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:32:37,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:32:37,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:32:37,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:32:37,237 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-11 02:32:37,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:32:37,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:32:37,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:32:37,535 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:32:37,535 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:32:37,536 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2020-07-11 02:32:37,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76617e66d/df4e33b8b96c442386c16e144c76f787/FLAGe3ca3c36f [2020-07-11 02:32:38,043 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:32:38,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-11 02:32:38,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76617e66d/df4e33b8b96c442386c16e144c76f787/FLAGe3ca3c36f [2020-07-11 02:32:38,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76617e66d/df4e33b8b96c442386c16e144c76f787 [2020-07-11 02:32:38,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:32:38,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:32:38,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:38,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:32:38,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:32:38,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760bdb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38, skipping insertion in model container [2020-07-11 02:32:38,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:32:38,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:32:38,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:38,736 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:32:38,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:38,770 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:32:38,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38 WrapperNode [2020-07-11 02:32:38,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:38,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:32:38,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:32:38,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:32:38,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (1/1) ... [2020-07-11 02:32:38,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:32:38,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:32:38,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:32:38,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:32:38,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (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-11 02:32:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:32:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:32:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:32:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:32:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:32:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:32:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:32:39,286 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:32:39,287 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:32:39,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:39 BoogieIcfgContainer [2020-07-11 02:32:39,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:32:39,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:32:39,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:32:39,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:32:39,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:32:38" (1/3) ... [2020-07-11 02:32:39,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc08554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:39, skipping insertion in model container [2020-07-11 02:32:39,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:38" (2/3) ... [2020-07-11 02:32:39,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc08554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:39, skipping insertion in model container [2020-07-11 02:32:39,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:39" (3/3) ... [2020-07-11 02:32:39,302 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-11 02:32:39,316 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:32:39,325 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:32:39,343 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:32:39,370 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:32:39,370 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:32:39,370 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:32:39,371 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:32:39,371 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:32:39,371 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:32:39,371 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:32:39,371 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:32:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-11 02:32:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 02:32:39,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:39,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:39,405 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:39,412 INFO L82 PathProgramCache]: Analyzing trace with hash 789700725, now seen corresponding path program 1 times [2020-07-11 02:32:39,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:39,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584340253] [2020-07-11 02:32:39,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:39,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-11 02:32:39,596 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-11 02:32:39,598 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2020-07-11 02:32:39,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-11 02:32:39,598 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-11 02:32:39,599 INFO L263 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret3 := main(); {35#true} is VALID [2020-07-11 02:32:39,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-11 02:32:39,599 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} ~n~0 := 0; {35#true} is VALID [2020-07-11 02:32:39,600 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35#true} is VALID [2020-07-11 02:32:39,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} ~k~0 := #t~nondet0; {35#true} is VALID [2020-07-11 02:32:39,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} havoc #t~nondet0; {35#true} is VALID [2020-07-11 02:32:39,601 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {35#true} is VALID [2020-07-11 02:32:39,601 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-11 02:32:39,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-11 02:32:39,605 INFO L263 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {36#false} is VALID [2020-07-11 02:32:39,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-11 02:32:39,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-11 02:32:39,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-11 02:32:39,610 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-11 02:32:39,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584340253] [2020-07-11 02:32:39,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:39,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:32:39,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612071974] [2020-07-11 02:32:39,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-11 02:32:39,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:39,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:32:39,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:39,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:32:39,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:39,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:32:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:32:39,693 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-11 02:32:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:39,805 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-11 02:32:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:32:39,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-11 02:32:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-11 02:32:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-11 02:32:39,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-11 02:32:39,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:39,973 INFO L225 Difference]: With dead ends: 44 [2020-07-11 02:32:39,974 INFO L226 Difference]: Without dead ends: 24 [2020-07-11 02:32:39,987 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-11 02:32:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-11 02:32:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-11 02:32:40,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:40,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:40,079 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:40,079 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:40,086 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-11 02:32:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:32:40,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:40,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:40,090 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:40,090 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-11 02:32:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:40,098 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-11 02:32:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:32:40,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:40,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:40,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:40,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-11 02:32:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-11 02:32:40,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2020-07-11 02:32:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:40,109 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-11 02:32:40,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:32:40,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-11 02:32:40,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-11 02:32:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 02:32:40,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:40,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:40,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:40,156 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash 774924389, now seen corresponding path program 1 times [2020-07-11 02:32:40,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:40,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264864971] [2020-07-11 02:32:40,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:40,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-11 02:32:40,451 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-11 02:32:40,452 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-11 02:32:40,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-11 02:32:40,452 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-11 02:32:40,453 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret3 := main(); {225#true} is VALID [2020-07-11 02:32:40,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~i~0 := 0; {225#true} is VALID [2020-07-11 02:32:40,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} ~n~0 := 0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:40,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:40,458 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:40,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:40,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:40,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {230#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:40,463 INFO L280 TraceCheckUtils]: 11: Hoare triple {230#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {231#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-11 02:32:40,465 INFO L263 TraceCheckUtils]: 12: Hoare triple {231#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {232#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:40,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {232#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {233#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:40,474 INFO L280 TraceCheckUtils]: 14: Hoare triple {233#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {226#false} is VALID [2020-07-11 02:32:40,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-11 02:32:40,477 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-11 02:32:40,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264864971] [2020-07-11 02:32:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:32:40,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655375475] [2020-07-11 02:32:40,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-11 02:32:40,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:40,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:32:40,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:40,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:32:40,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:40,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:32:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:32:40,523 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2020-07-11 02:32:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:40,873 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-11 02:32:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:32:40,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-11 02:32:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-11 02:32:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-11 02:32:40,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-11 02:32:40,939 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-11 02:32:40,941 INFO L225 Difference]: With dead ends: 43 [2020-07-11 02:32:40,942 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 02:32:40,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 02:32:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2020-07-11 02:32:40,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:40,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 25 states. [2020-07-11 02:32:40,972 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 25 states. [2020-07-11 02:32:40,972 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 25 states. [2020-07-11 02:32:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:40,976 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-11 02:32:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-11 02:32:40,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:40,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:40,977 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 38 states. [2020-07-11 02:32:40,977 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 38 states. [2020-07-11 02:32:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:40,981 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-11 02:32:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-11 02:32:40,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:40,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:40,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:40,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 02:32:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-11 02:32:40,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2020-07-11 02:32:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:40,986 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-11 02:32:40,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:32:40,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-11 02:32:41,017 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-11 02:32:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-11 02:32:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-11 02:32:41,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:41,019 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-11 02:32:41,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:41,019 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:41,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 775379929, now seen corresponding path program 1 times [2020-07-11 02:32:41,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:41,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050998001] [2020-07-11 02:32:41,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:41,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {454#true} assume true; {454#true} is VALID [2020-07-11 02:32:41,266 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {454#true} {454#true} #62#return; {454#true} is VALID [2020-07-11 02:32:41,266 INFO L263 TraceCheckUtils]: 0: Hoare triple {454#true} call ULTIMATE.init(); {454#true} is VALID [2020-07-11 02:32:41,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {454#true} assume true; {454#true} is VALID [2020-07-11 02:32:41,267 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {454#true} {454#true} #62#return; {454#true} is VALID [2020-07-11 02:32:41,267 INFO L263 TraceCheckUtils]: 3: Hoare triple {454#true} call #t~ret3 := main(); {454#true} is VALID [2020-07-11 02:32:41,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {454#true} ~i~0 := 0; {454#true} is VALID [2020-07-11 02:32:41,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {454#true} ~n~0 := 0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,272 INFO L280 TraceCheckUtils]: 6: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:41,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:41,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:41,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} #t~post1 := ~i~0; {460#(and (<= main_~n~0 0) (<= |main_#t~post1| (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:41,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {460#(and (<= main_~n~0 0) (<= |main_#t~post1| (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} havoc #t~post1; {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:41,292 INFO L280 TraceCheckUtils]: 16: Hoare triple {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} assume !(~i~0 < 2 * ~k~0); {462#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-11 02:32:41,294 INFO L263 TraceCheckUtils]: 17: Hoare triple {462#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {463#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:41,296 INFO L280 TraceCheckUtils]: 18: Hoare triple {463#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {464#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:41,297 INFO L280 TraceCheckUtils]: 19: Hoare triple {464#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {455#false} is VALID [2020-07-11 02:32:41,297 INFO L280 TraceCheckUtils]: 20: Hoare triple {455#false} assume !false; {455#false} is VALID [2020-07-11 02:32:41,300 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-11 02:32:41,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050998001] [2020-07-11 02:32:41,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:41,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:32:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018264817] [2020-07-11 02:32:41,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-11 02:32:41,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:41,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:32:41,336 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-11 02:32:41,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:32:41,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:32:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:41,338 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2020-07-11 02:32:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:41,915 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-11 02:32:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:32:41,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-11 02:32:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-11 02:32:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-11 02:32:41,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-11 02:32:41,983 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-11 02:32:41,985 INFO L225 Difference]: With dead ends: 48 [2020-07-11 02:32:41,985 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 02:32:41,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:32:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 02:32:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2020-07-11 02:32:42,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:42,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 30 states. [2020-07-11 02:32:42,017 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 30 states. [2020-07-11 02:32:42,017 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 30 states. [2020-07-11 02:32:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:42,021 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-11 02:32:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-11 02:32:42,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:42,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:42,022 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 43 states. [2020-07-11 02:32:42,023 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 43 states. [2020-07-11 02:32:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:42,026 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-11 02:32:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-11 02:32:42,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:42,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:42,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:42,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-11 02:32:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-11 02:32:42,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2020-07-11 02:32:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:42,030 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-11 02:32:42,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:32:42,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-11 02:32:42,068 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-11 02:32:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-11 02:32:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:32:42,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:42,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:42,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:42,070 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:42,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1973531292, now seen corresponding path program 1 times [2020-07-11 02:32:42,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:42,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768512428] [2020-07-11 02:32:42,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:42,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-11 02:32:42,218 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {721#true} {721#true} #62#return; {721#true} is VALID [2020-07-11 02:32:42,219 INFO L263 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {721#true} is VALID [2020-07-11 02:32:42,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-11 02:32:42,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #62#return; {721#true} is VALID [2020-07-11 02:32:42,220 INFO L263 TraceCheckUtils]: 3: Hoare triple {721#true} call #t~ret3 := main(); {721#true} is VALID [2020-07-11 02:32:42,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {721#true} ~i~0 := 0; {721#true} is VALID [2020-07-11 02:32:42,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {721#true} ~n~0 := 0; {721#true} is VALID [2020-07-11 02:32:42,221 INFO L280 TraceCheckUtils]: 6: Hoare triple {721#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {721#true} is VALID [2020-07-11 02:32:42,221 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#true} ~k~0 := #t~nondet0; {721#true} is VALID [2020-07-11 02:32:42,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {721#true} havoc #t~nondet0; {721#true} is VALID [2020-07-11 02:32:42,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {721#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {721#true} is VALID [2020-07-11 02:32:42,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {721#true} ~i~0 := 0; {725#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:32:42,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,225 INFO L280 TraceCheckUtils]: 13: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post2 := ~n~0; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} ~n~0 := 1 + #t~post2; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} havoc #t~post2; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,228 INFO L280 TraceCheckUtils]: 16: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post1 := ~i~0; {727#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} is VALID [2020-07-11 02:32:42,229 INFO L280 TraceCheckUtils]: 17: Hoare triple {727#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} ~i~0 := 1 + #t~post1; {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-11 02:32:42,230 INFO L280 TraceCheckUtils]: 18: Hoare triple {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} havoc #t~post1; {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-11 02:32:42,230 INFO L280 TraceCheckUtils]: 19: Hoare triple {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} assume !(~i~0 < 2 * ~k~0); {722#false} is VALID [2020-07-11 02:32:42,231 INFO L263 TraceCheckUtils]: 20: Hoare triple {722#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {722#false} is VALID [2020-07-11 02:32:42,231 INFO L280 TraceCheckUtils]: 21: Hoare triple {722#false} ~cond := #in~cond; {722#false} is VALID [2020-07-11 02:32:42,231 INFO L280 TraceCheckUtils]: 22: Hoare triple {722#false} assume 0 == ~cond; {722#false} is VALID [2020-07-11 02:32:42,232 INFO L280 TraceCheckUtils]: 23: Hoare triple {722#false} assume !false; {722#false} is VALID [2020-07-11 02:32:42,233 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-11 02:32:42,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768512428] [2020-07-11 02:32:42,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:42,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 02:32:42,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128527433] [2020-07-11 02:32:42,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 02:32:42,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:42,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:32:42,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:42,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:32:42,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:32:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:42,260 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2020-07-11 02:32:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:42,577 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-11 02:32:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:32:42,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-11 02:32:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-11 02:32:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:32:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-11 02:32:42,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2020-07-11 02:32:42,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:42,644 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:32:42,644 INFO L226 Difference]: Without dead ends: 41 [2020-07-11 02:32:42,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-11 02:32:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2020-07-11 02:32:42,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:42,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2020-07-11 02:32:42,690 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2020-07-11 02:32:42,690 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2020-07-11 02:32:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:42,692 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 02:32:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-11 02:32:42,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:42,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:42,695 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2020-07-11 02:32:42,695 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2020-07-11 02:32:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:42,698 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-11 02:32:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-11 02:32:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:42,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:42,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-11 02:32:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-11 02:32:42,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 24 [2020-07-11 02:32:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:42,702 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-11 02:32:42,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:32:42,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-11 02:32:42,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-11 02:32:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 02:32:42,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:42,753 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:42,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:32:42,753 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1981883390, now seen corresponding path program 1 times [2020-07-11 02:32:42,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:42,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691005520] [2020-07-11 02:32:42,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:43,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-11 02:32:43,185 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1005#true} {1005#true} #62#return; {1005#true} is VALID [2020-07-11 02:32:43,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2020-07-11 02:32:43,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-11 02:32:43,186 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1005#true} {1005#true} #62#return; {1005#true} is VALID [2020-07-11 02:32:43,186 INFO L263 TraceCheckUtils]: 3: Hoare triple {1005#true} call #t~ret3 := main(); {1005#true} is VALID [2020-07-11 02:32:43,186 INFO L280 TraceCheckUtils]: 4: Hoare triple {1005#true} ~i~0 := 0; {1005#true} is VALID [2020-07-11 02:32:43,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {1005#true} ~n~0 := 0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:43,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:43,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:43,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:43,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:43,190 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:43,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:43,192 INFO L280 TraceCheckUtils]: 12: Hoare triple {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:43,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1011#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-11 02:32:43,194 INFO L280 TraceCheckUtils]: 14: Hoare triple {1011#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:43,195 INFO L280 TraceCheckUtils]: 15: Hoare triple {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:43,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1013#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:43,203 INFO L280 TraceCheckUtils]: 17: Hoare triple {1013#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:43,203 INFO L280 TraceCheckUtils]: 18: Hoare triple {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:43,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1015#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,205 INFO L280 TraceCheckUtils]: 20: Hoare triple {1015#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1015#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,205 INFO L280 TraceCheckUtils]: 21: Hoare triple {1015#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0; {1016#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,206 INFO L280 TraceCheckUtils]: 22: Hoare triple {1016#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1017#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,207 INFO L280 TraceCheckUtils]: 23: Hoare triple {1017#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {1017#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,208 INFO L280 TraceCheckUtils]: 24: Hoare triple {1017#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1018#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:43,209 INFO L263 TraceCheckUtils]: 25: Hoare triple {1018#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1019#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:43,209 INFO L280 TraceCheckUtils]: 26: Hoare triple {1019#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1020#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:43,210 INFO L280 TraceCheckUtils]: 27: Hoare triple {1020#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1006#false} is VALID [2020-07-11 02:32:43,210 INFO L280 TraceCheckUtils]: 28: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2020-07-11 02:32:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:43,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691005520] [2020-07-11 02:32:43,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:43,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 02:32:43,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001361494] [2020-07-11 02:32:43,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-11 02:32:43,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:43,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:32:43,248 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-11 02:32:43,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:32:43,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:32:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:32:43,250 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 14 states. [2020-07-11 02:32:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:44,226 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-07-11 02:32:44,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-11 02:32:44,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-11 02:32:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:32:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2020-07-11 02:32:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:32:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2020-07-11 02:32:44,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2020-07-11 02:32:44,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:44,306 INFO L225 Difference]: With dead ends: 67 [2020-07-11 02:32:44,306 INFO L226 Difference]: Without dead ends: 43 [2020-07-11 02:32:44,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-07-11 02:32:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-11 02:32:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-07-11 02:32:44,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:44,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2020-07-11 02:32:44,398 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2020-07-11 02:32:44,398 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2020-07-11 02:32:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:44,400 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:32:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:32:44,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:44,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:44,401 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2020-07-11 02:32:44,401 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2020-07-11 02:32:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:44,403 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-11 02:32:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-11 02:32:44,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:44,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:44,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:44,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-11 02:32:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-11 02:32:44,407 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2020-07-11 02:32:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:44,407 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-11 02:32:44,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:32:44,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2020-07-11 02:32:44,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-11 02:32:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 02:32:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:32:44,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:44,455 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:44,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:32:44,456 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -282773191, now seen corresponding path program 2 times [2020-07-11 02:32:44,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:44,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90673027] [2020-07-11 02:32:44,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:44,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:32:44,659 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1343#true} {1343#true} #62#return; {1343#true} is VALID [2020-07-11 02:32:44,660 INFO L263 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2020-07-11 02:32:44,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:32:44,660 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #62#return; {1343#true} is VALID [2020-07-11 02:32:44,661 INFO L263 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret3 := main(); {1343#true} is VALID [2020-07-11 02:32:44,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {1343#true} ~i~0 := 0; {1343#true} is VALID [2020-07-11 02:32:44,661 INFO L280 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := 0; {1343#true} is VALID [2020-07-11 02:32:44,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {1343#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1343#true} is VALID [2020-07-11 02:32:44,662 INFO L280 TraceCheckUtils]: 7: Hoare triple {1343#true} ~k~0 := #t~nondet0; {1343#true} is VALID [2020-07-11 02:32:44,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {1343#true} havoc #t~nondet0; {1343#true} is VALID [2020-07-11 02:32:44,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1343#true} is VALID [2020-07-11 02:32:44,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {1343#true} ~i~0 := 0; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,664 INFO L280 TraceCheckUtils]: 11: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,665 INFO L280 TraceCheckUtils]: 12: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post2 := ~n~0; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,666 INFO L280 TraceCheckUtils]: 14: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} ~n~0 := 1 + #t~post2; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} havoc #t~post2; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-11 02:32:44,667 INFO L280 TraceCheckUtils]: 16: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post1 := ~i~0; {1348#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} is VALID [2020-07-11 02:32:44,668 INFO L280 TraceCheckUtils]: 17: Hoare triple {1348#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} ~i~0 := 1 + #t~post1; {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-11 02:32:44,669 INFO L280 TraceCheckUtils]: 18: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} havoc #t~post1; {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-11 02:32:44,670 INFO L280 TraceCheckUtils]: 19: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} assume !!(~i~0 < 2 * ~k~0); {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-11 02:32:44,670 INFO L280 TraceCheckUtils]: 20: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-11 02:32:44,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} #t~post1 := ~i~0; {1350#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-11 02:32:44,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {1350#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-11 02:32:44,673 INFO L280 TraceCheckUtils]: 23: Hoare triple {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} havoc #t~post1; {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-11 02:32:44,674 INFO L280 TraceCheckUtils]: 24: Hoare triple {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,675 INFO L280 TraceCheckUtils]: 25: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,676 INFO L280 TraceCheckUtils]: 26: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post2 := ~n~0; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,677 INFO L280 TraceCheckUtils]: 27: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} ~n~0 := 1 + #t~post2; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,678 INFO L280 TraceCheckUtils]: 28: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} havoc #t~post2; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,679 INFO L280 TraceCheckUtils]: 29: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post1 := ~i~0; {1353#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,680 INFO L280 TraceCheckUtils]: 30: Hoare triple {1353#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} ~i~0 := 1 + #t~post1; {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,681 INFO L280 TraceCheckUtils]: 31: Hoare triple {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} havoc #t~post1; {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-11 02:32:44,682 INFO L280 TraceCheckUtils]: 32: Hoare triple {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1344#false} is VALID [2020-07-11 02:32:44,682 INFO L263 TraceCheckUtils]: 33: Hoare triple {1344#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1344#false} is VALID [2020-07-11 02:32:44,683 INFO L280 TraceCheckUtils]: 34: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2020-07-11 02:32:44,683 INFO L280 TraceCheckUtils]: 35: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2020-07-11 02:32:44,683 INFO L280 TraceCheckUtils]: 36: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2020-07-11 02:32:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:44,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90673027] [2020-07-11 02:32:44,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:44,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:32:44,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344569539] [2020-07-11 02:32:44,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-11 02:32:44,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:44,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:32:44,742 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-11 02:32:44,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:32:44,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:32:44,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:44,744 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 10 states. [2020-07-11 02:32:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:45,701 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2020-07-11 02:32:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:32:45,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-11 02:32:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-11 02:32:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-11 02:32:45,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2020-07-11 02:32:45,775 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-11 02:32:45,777 INFO L225 Difference]: With dead ends: 65 [2020-07-11 02:32:45,777 INFO L226 Difference]: Without dead ends: 60 [2020-07-11 02:32:45,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-11 02:32:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-11 02:32:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-07-11 02:32:45,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:45,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2020-07-11 02:32:45,892 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2020-07-11 02:32:45,892 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2020-07-11 02:32:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:45,895 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:32:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-11 02:32:45,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:45,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:45,896 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2020-07-11 02:32:45,896 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2020-07-11 02:32:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:45,898 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:32:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-11 02:32:45,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:45,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:45,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:45,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-11 02:32:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-11 02:32:45,901 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 37 [2020-07-11 02:32:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:45,902 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-11 02:32:45,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:32:45,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-11 02:32:45,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-11 02:32:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 02:32:45,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:45,992 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:45,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:32:45,993 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1065873285, now seen corresponding path program 3 times [2020-07-11 02:32:45,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:45,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265607207] [2020-07-11 02:32:45,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:46,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {1738#true} assume true; {1738#true} is VALID [2020-07-11 02:32:46,528 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1738#true} {1738#true} #62#return; {1738#true} is VALID [2020-07-11 02:32:46,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {1738#true} call ULTIMATE.init(); {1738#true} is VALID [2020-07-11 02:32:46,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {1738#true} assume true; {1738#true} is VALID [2020-07-11 02:32:46,529 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1738#true} {1738#true} #62#return; {1738#true} is VALID [2020-07-11 02:32:46,529 INFO L263 TraceCheckUtils]: 3: Hoare triple {1738#true} call #t~ret3 := main(); {1738#true} is VALID [2020-07-11 02:32:46,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {1738#true} ~i~0 := 0; {1738#true} is VALID [2020-07-11 02:32:46,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {1738#true} ~n~0 := 0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:46,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:46,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:46,533 INFO L280 TraceCheckUtils]: 8: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:46,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-11 02:32:46,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,552 INFO L280 TraceCheckUtils]: 12: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,553 INFO L280 TraceCheckUtils]: 13: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-11 02:32:46,555 INFO L280 TraceCheckUtils]: 14: Hoare triple {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,556 INFO L280 TraceCheckUtils]: 15: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,557 INFO L280 TraceCheckUtils]: 16: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,558 INFO L280 TraceCheckUtils]: 17: Hoare triple {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,559 INFO L280 TraceCheckUtils]: 18: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,560 INFO L280 TraceCheckUtils]: 19: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,561 INFO L280 TraceCheckUtils]: 20: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,562 INFO L280 TraceCheckUtils]: 21: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1748#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-11 02:32:46,563 INFO L280 TraceCheckUtils]: 22: Hoare triple {1748#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,564 INFO L280 TraceCheckUtils]: 23: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} havoc #t~post1; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,565 INFO L280 TraceCheckUtils]: 24: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,566 INFO L280 TraceCheckUtils]: 25: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-11 02:32:46,567 INFO L280 TraceCheckUtils]: 26: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-11 02:32:46,568 INFO L280 TraceCheckUtils]: 27: Hoare triple {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,568 INFO L280 TraceCheckUtils]: 28: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,569 INFO L280 TraceCheckUtils]: 29: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,570 INFO L280 TraceCheckUtils]: 30: Hoare triple {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,571 INFO L280 TraceCheckUtils]: 31: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-11 02:32:46,572 INFO L280 TraceCheckUtils]: 32: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1749#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,573 INFO L280 TraceCheckUtils]: 33: Hoare triple {1749#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1749#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,573 INFO L280 TraceCheckUtils]: 34: Hoare triple {1749#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0; {1750#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,577 INFO L280 TraceCheckUtils]: 35: Hoare triple {1750#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1751#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,578 INFO L280 TraceCheckUtils]: 36: Hoare triple {1751#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {1751#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,578 INFO L280 TraceCheckUtils]: 37: Hoare triple {1751#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1752#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-11 02:32:46,579 INFO L263 TraceCheckUtils]: 38: Hoare triple {1752#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1753#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:46,580 INFO L280 TraceCheckUtils]: 39: Hoare triple {1753#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1754#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:46,580 INFO L280 TraceCheckUtils]: 40: Hoare triple {1754#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1739#false} is VALID [2020-07-11 02:32:46,580 INFO L280 TraceCheckUtils]: 41: Hoare triple {1739#false} assume !false; {1739#false} is VALID [2020-07-11 02:32:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-11 02:32:46,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265607207] [2020-07-11 02:32:46,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:46,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:32:46,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822762981] [2020-07-11 02:32:46,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-11 02:32:46,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:46,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:32:46,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:46,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:32:46,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:32:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:32:46,634 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 15 states. [2020-07-11 02:32:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:47,734 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-11 02:32:47,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 02:32:47,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-11 02:32:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:32:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-11 02:32:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:32:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-11 02:32:47,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2020-07-11 02:32:47,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:47,800 INFO L225 Difference]: With dead ends: 71 [2020-07-11 02:32:47,800 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:47,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2020-07-11 02:32:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:47,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:47,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:47,803 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:47,803 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:47,803 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:47,804 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:47,804 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:47,804 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:47,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:47,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:47,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:47,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:47,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-11 02:32:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:47,805 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:47,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:32:47,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:47,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:47,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:47,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:32:47,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:48,368 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-07-11 02:32:48,681 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:48,682 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:48,683 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:48,683 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:48,683 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:48,683 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:48,683 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 25) the Hoare annotation is: true [2020-07-11 02:32:48,683 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-11 02:32:48,684 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~n~0 main_~k~0))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0)))) [2020-07-11 02:32:48,684 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-11 02:32:48,684 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:32:48,684 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0)) [2020-07-11 02:32:48,684 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 25) the Hoare annotation is: true [2020-07-11 02:32:48,684 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-11 02:32:48,685 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0))) [2020-07-11 02:32:48,685 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse1 (* 2 |main_#t~post2|))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse1 main_~i~0) (<= .cse0 main_~i~0) (<= main_~i~0 .cse1))) [2020-07-11 02:32:48,685 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-11 02:32:48,685 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse1 (+ main_~i~0 2)) (.cse2 (* 2 |main_#t~post2|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 2 main_~k~0)) (<= .cse2 main_~i~0) (<= main_~i~0 .cse2))) [2020-07-11 02:32:48,685 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-11 02:32:48,686 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-11 02:32:48,686 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 2 main_~k~0)))) (let ((.cse2 (+ main_~i~0 1))) (and (<= .cse0 .cse2) (<= .cse2 .cse0) (<= main_~n~0 main_~k~0))))) [2020-07-11 02:32:48,686 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-11 02:32:48,686 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 1)) (.cse2 (+ |main_#t~post1| 1))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse1 .cse0) (<= .cse0 .cse2) (<= main_~n~0 main_~k~0))) (let ((.cse3 (+ main_~i~0 2)) (.cse4 (+ |main_#t~post1| 2))) (and (<= .cse0 .cse3) (<= .cse0 .cse4) (<= .cse3 .cse0) (<= .cse3 (* 2 main_~k~0)) (<= .cse4 .cse0))))) [2020-07-11 02:32:48,686 INFO L264 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse2 (+ |main_#t~post1| 2)) (.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 (* 2 main_~k~0)) (<= .cse0 .cse2) (<= .cse2 .cse0) (<= .cse1 .cse0))) (let ((.cse3 (+ |main_#t~post1| 1))) (and (<= .cse3 .cse0) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) (<= .cse0 .cse3) (<= main_~n~0 main_~k~0))))) [2020-07-11 02:32:48,687 INFO L264 CegarLoopResult]: At program point L18-6(lines 18 22) the Hoare annotation is: (let ((.cse2 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse2)) (.cse1 (<= .cse2 main_~i~0))) (or (and (<= 0 main_~n~0) (<= main_~n~0 0) .cse0 .cse1) (and .cse0 .cse1 (<= main_~n~0 main_~k~0)) (let ((.cse3 (+ main_~i~0 1))) (and (<= .cse2 .cse3) (<= .cse3 (* 2 main_~k~0)) (<= .cse3 .cse2)))))) [2020-07-11 02:32:48,687 INFO L264 CegarLoopResult]: At program point L18-7(lines 18 22) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0))) (or (and .cse0 (<= main_~n~0 main_~k~0)) (and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= 0 main_~n~0) (<= main_~n~0 0) .cse0))) [2020-07-11 02:32:48,687 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:48,687 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:48,687 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:48,687 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:48,687 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:48,687 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:48,691 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:48,692 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:48,692 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:48,693 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:48,693 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:48,705 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:48,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:48 BoogieIcfgContainer [2020-07-11 02:32:48,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:48,721 INFO L168 Benchmark]: Toolchain (without parser) took 10241.77 ms. Allocated memory was 144.7 MB in the beginning and 325.6 MB in the end (delta: 180.9 MB). Free memory was 102.0 MB in the beginning and 144.2 MB in the end (delta: -42.2 MB). Peak memory consumption was 138.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,722 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.14 ms. Allocated memory is still 144.7 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,724 INFO L168 Benchmark]: Boogie Preprocessor took 135.22 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.9 MB in the beginning and 181.3 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,724 INFO L168 Benchmark]: RCFGBuilder took 385.39 ms. Allocated memory is still 203.4 MB. Free memory was 181.3 MB in the beginning and 162.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,725 INFO L168 Benchmark]: TraceAbstraction took 9425.28 ms. Allocated memory was 203.4 MB in the beginning and 325.6 MB in the end (delta: 122.2 MB). Free memory was 162.2 MB in the beginning and 144.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:48,729 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.14 ms. Allocated memory is still 144.7 MB. Free memory was 101.6 MB in the beginning and 91.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.22 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.9 MB in the beginning and 181.3 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.39 ms. Allocated memory is still 203.4 MB. Free memory was 181.3 MB in the beginning and 162.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9425.28 ms. Allocated memory was 203.4 MB in the beginning and 325.6 MB in the end (delta: 122.2 MB). Free memory was 162.2 MB in the beginning and 144.2 MB in the end (delta: 18.0 MB). Peak memory consumption was 140.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((0 <= n && n <= 0) && i <= 2 * n) && 2 * n <= i) || ((i <= 2 * n && 2 * n <= i) && n <= k)) || ((2 * n <= i + 1 && i + 1 <= 2 * k) && i + 1 <= 2 * n) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.4s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 145 SDslu, 631 SDs, 0 SdLazy, 637 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 80 PreInvPairs, 132 NumberOfFragments, 469 HoareAnnotationTreeSize, 80 FomulaSimplifications, 918 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 693 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 39476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 9/67 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...