/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:47,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:47,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:47,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:47,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:47,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:47,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:47,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:47,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:47,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:47,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:47,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:47,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:47,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:47,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:47,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:47,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:47,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:47,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:47,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:47,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:47,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:47,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:47,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:47,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:47,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:47,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:47,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:47,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:47,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:47,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:47,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:47,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:47,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:47,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:47,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:47,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:47,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:47,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:47,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:47,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:47,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:47,551 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:47,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:47,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:47,552 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:47,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:47,554 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:47,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:47,554 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:47,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:47,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:47,555 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:47,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:47,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:47,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:47,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:47,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:47,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:47,556 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:47,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:47,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:47,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:47,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:47,869 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:47,870 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-18 00:47:47,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6ff2221/54138212a808452c868b1e3d50a603de/FLAG1de60b18c [2020-07-18 00:47:48,377 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:48,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-18 00:47:48,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6ff2221/54138212a808452c868b1e3d50a603de/FLAG1de60b18c [2020-07-18 00:47:48,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a6ff2221/54138212a808452c868b1e3d50a603de [2020-07-18 00:47:48,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:48,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:48,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:48,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:48,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:48,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:48" (1/1) ... [2020-07-18 00:47:48,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bb58da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:48, skipping insertion in model container [2020-07-18 00:47:48,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:48" (1/1) ... [2020-07-18 00:47:48,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:48,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:49,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:49,058 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:49,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:49,093 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:49,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49 WrapperNode [2020-07-18 00:47:49,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:49,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:49,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:49,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:49,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... [2020-07-18 00:47:49,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:49,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:49,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:49,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:49,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:49,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:49,288 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:49,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:49,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:49,288 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:49,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:49,646 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:49,646 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:47:49,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:49 BoogieIcfgContainer [2020-07-18 00:47:49,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:49,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:49,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:49,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:49,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:48" (1/3) ... [2020-07-18 00:47:49,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbabe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:49, skipping insertion in model container [2020-07-18 00:47:49,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:49" (2/3) ... [2020-07-18 00:47:49,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbabe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:49, skipping insertion in model container [2020-07-18 00:47:49,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:49" (3/3) ... [2020-07-18 00:47:49,665 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-18 00:47:49,676 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:49,684 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:49,698 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:49,719 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:49,719 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:49,719 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:49,720 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:49,720 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:49,720 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:49,720 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:49,720 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-18 00:47:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 00:47:49,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:49,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:49,746 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:49,751 INFO L82 PathProgramCache]: Analyzing trace with hash 546510172, now seen corresponding path program 1 times [2020-07-18 00:47:49,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:49,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956771590] [2020-07-18 00:47:49,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:49,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-18 00:47:49,904 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-18 00:47:49,905 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-18 00:47:49,906 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-18 00:47:49,906 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-18 00:47:49,907 INFO L263 TraceCheckUtils]: 3: Hoare triple {40#true} call #t~ret3 := main(); {40#true} is VALID [2020-07-18 00:47:49,907 INFO L280 TraceCheckUtils]: 4: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-18 00:47:49,907 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} ~x~0 := 0; {40#true} is VALID [2020-07-18 00:47:49,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} ~y~0 := 0; {40#true} is VALID [2020-07-18 00:47:49,908 INFO L280 TraceCheckUtils]: 7: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {40#true} is VALID [2020-07-18 00:47:49,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~n~0 := #t~nondet0; {40#true} is VALID [2020-07-18 00:47:49,909 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} havoc #t~nondet0; {40#true} is VALID [2020-07-18 00:47:49,909 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#true} assume !!(~n~0 > 0); {40#true} is VALID [2020-07-18 00:47:49,909 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-18 00:47:49,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-18 00:47:49,911 INFO L263 TraceCheckUtils]: 13: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {41#false} is VALID [2020-07-18 00:47:49,911 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-18 00:47:49,912 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-18 00:47:49,912 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-18 00:47:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:49,918 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:49,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956771590] [2020-07-18 00:47:49,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:49,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:47:49,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511715863] [2020-07-18 00:47:49,930 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-18 00:47:49,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:49,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:47:49,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:49,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:47:49,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:47:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:47:50,010 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-18 00:47:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,151 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2020-07-18 00:47:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:47:50,152 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-18 00:47:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-18 00:47:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-18 00:47:50,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2020-07-18 00:47:50,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:50,313 INFO L225 Difference]: With dead ends: 61 [2020-07-18 00:47:50,313 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 00:47:50,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:47:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 00:47:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-18 00:47:50,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:50,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-18 00:47:50,374 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-18 00:47:50,375 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-18 00:47:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,381 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 00:47:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:47:50,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:50,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:50,383 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-18 00:47:50,383 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-18 00:47:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,388 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 00:47:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:47:50,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:50,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:50,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:50,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:47:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-18 00:47:50,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2020-07-18 00:47:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:50,396 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-18 00:47:50,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:47:50,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-18 00:47:50,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:47:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-18 00:47:50,443 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:50,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:50,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:50,444 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 528039752, now seen corresponding path program 1 times [2020-07-18 00:47:50,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:50,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493143380] [2020-07-18 00:47:50,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:50,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-18 00:47:50,523 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-18 00:47:50,523 INFO L263 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2020-07-18 00:47:50,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-18 00:47:50,524 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-18 00:47:50,525 INFO L263 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret3 := main(); {292#true} is VALID [2020-07-18 00:47:50,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {292#true} ~i~0 := 0; {292#true} is VALID [2020-07-18 00:47:50,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#true} ~x~0 := 0; {292#true} is VALID [2020-07-18 00:47:50,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {292#true} ~y~0 := 0; {292#true} is VALID [2020-07-18 00:47:50,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {292#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {292#true} is VALID [2020-07-18 00:47:50,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {292#true} ~n~0 := #t~nondet0; {292#true} is VALID [2020-07-18 00:47:50,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#true} havoc #t~nondet0; {292#true} is VALID [2020-07-18 00:47:50,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#true} assume !!(~n~0 > 0); {296#(<= 1 main_~n~0)} is VALID [2020-07-18 00:47:50,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(<= 1 main_~n~0)} ~i~0 := 0; {297#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-18 00:47:50,531 INFO L280 TraceCheckUtils]: 12: Hoare triple {297#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {293#false} is VALID [2020-07-18 00:47:50,531 INFO L263 TraceCheckUtils]: 13: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {293#false} is VALID [2020-07-18 00:47:50,531 INFO L280 TraceCheckUtils]: 14: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2020-07-18 00:47:50,532 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2020-07-18 00:47:50,532 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-18 00:47:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:50,539 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:50,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493143380] [2020-07-18 00:47:50,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:50,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:47:50,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147773359] [2020-07-18 00:47:50,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-18 00:47:50,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:50,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:47:50,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:50,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:47:50,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:47:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:50,567 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-18 00:47:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,737 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-18 00:47:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:47:50,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-18 00:47:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-18 00:47:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-18 00:47:50,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-18 00:47:50,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:50,799 INFO L225 Difference]: With dead ends: 39 [2020-07-18 00:47:50,799 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 00:47:50,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 00:47:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-18 00:47:50,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:50,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-18 00:47:50,841 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 00:47:50,842 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 00:47:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,848 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-18 00:47:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:47:50,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:50,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:50,850 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-18 00:47:50,850 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-18 00:47:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:50,860 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-18 00:47:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:47:50,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:50,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:50,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:50,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:47:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 00:47:50,867 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2020-07-18 00:47:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:50,867 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 00:47:50,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:47:50,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 00:47:50,914 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-18 00:47:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:47:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:47:50,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:50,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:50,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:50,917 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash -789875431, now seen corresponding path program 1 times [2020-07-18 00:47:50,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:50,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437721893] [2020-07-18 00:47:50,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:51,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-18 00:47:51,066 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-18 00:47:51,066 INFO L263 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2020-07-18 00:47:51,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-18 00:47:51,067 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-18 00:47:51,067 INFO L263 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret3 := main(); {508#true} is VALID [2020-07-18 00:47:51,067 INFO L280 TraceCheckUtils]: 4: Hoare triple {508#true} ~i~0 := 0; {508#true} is VALID [2020-07-18 00:47:51,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {508#true} ~x~0 := 0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,072 INFO L280 TraceCheckUtils]: 8: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,073 INFO L280 TraceCheckUtils]: 9: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,074 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,075 INFO L280 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,079 INFO L263 TraceCheckUtils]: 14: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:47:51,080 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {515#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:47:51,081 INFO L280 TraceCheckUtils]: 16: Hoare triple {515#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {509#false} is VALID [2020-07-18 00:47:51,081 INFO L280 TraceCheckUtils]: 17: Hoare triple {509#false} assume !false; {509#false} is VALID [2020-07-18 00:47:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:51,083 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:51,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437721893] [2020-07-18 00:47:51,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:51,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:47:51,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800600013] [2020-07-18 00:47:51,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-18 00:47:51,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:51,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:47:51,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:51,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:47:51,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:47:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:51,108 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2020-07-18 00:47:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:51,458 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-18 00:47:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:47:51,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-18 00:47:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-18 00:47:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:47:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-18 00:47:51,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-18 00:47:51,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:51,540 INFO L225 Difference]: With dead ends: 42 [2020-07-18 00:47:51,540 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:47:51,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:47:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2020-07-18 00:47:51,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:51,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2020-07-18 00:47:51,654 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2020-07-18 00:47:51,655 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2020-07-18 00:47:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:51,658 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-18 00:47:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-18 00:47:51,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:51,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:51,659 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2020-07-18 00:47:51,659 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2020-07-18 00:47:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:51,663 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-18 00:47:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-18 00:47:51,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:51,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:51,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:51,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-18 00:47:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-18 00:47:51,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 18 [2020-07-18 00:47:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:51,667 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-18 00:47:51,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:47:51,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-18 00:47:51,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-18 00:47:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:47:51,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:51,714 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 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-18 00:47:51,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:51,714 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1565658423, now seen corresponding path program 1 times [2020-07-18 00:47:51,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:51,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976330533] [2020-07-18 00:47:51,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:51,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-18 00:47:51,877 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-18 00:47:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:51,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-18 00:47:51,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-18 00:47:51,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-18 00:47:51,888 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {758#true} call ULTIMATE.init(); {758#true} is VALID [2020-07-18 00:47:51,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-18 00:47:51,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-18 00:47:51,890 INFO L263 TraceCheckUtils]: 3: Hoare triple {758#true} call #t~ret3 := main(); {758#true} is VALID [2020-07-18 00:47:51,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {758#true} ~i~0 := 0; {758#true} is VALID [2020-07-18 00:47:51,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {758#true} ~x~0 := 0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,893 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,895 INFO L280 TraceCheckUtils]: 9: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,897 INFO L280 TraceCheckUtils]: 12: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-18 00:47:51,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,899 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {758#true} is VALID [2020-07-18 00:47:51,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-18 00:47:51,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-18 00:47:51,900 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-18 00:47:51,901 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,902 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,903 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := #t~nondet2; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,904 INFO L280 TraceCheckUtils]: 21: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} havoc #t~nondet2; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-18 00:47:51,906 INFO L280 TraceCheckUtils]: 22: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(0 != ~y~0); {768#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} is VALID [2020-07-18 00:47:51,907 INFO L280 TraceCheckUtils]: 23: Hoare triple {768#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} ~x~0 := ~x~0 + ~y~0; {769#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-18 00:47:51,908 INFO L263 TraceCheckUtils]: 24: Hoare triple {769#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {770#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:47:51,909 INFO L280 TraceCheckUtils]: 25: Hoare triple {770#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {771#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:47:51,910 INFO L280 TraceCheckUtils]: 26: Hoare triple {771#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {759#false} is VALID [2020-07-18 00:47:51,910 INFO L280 TraceCheckUtils]: 27: Hoare triple {759#false} assume !false; {759#false} is VALID [2020-07-18 00:47:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:51,913 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:51,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976330533] [2020-07-18 00:47:51,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:51,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:47:51,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479838532] [2020-07-18 00:47:51,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:47:51,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:51,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:47:51,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:51,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:47:51,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:51,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:47:51,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:47:51,949 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 8 states. [2020-07-18 00:47:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:52,448 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-18 00:47:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:47:52,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:47:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-18 00:47:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:47:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-18 00:47:52,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-18 00:47:52,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:52,516 INFO L225 Difference]: With dead ends: 46 [2020-07-18 00:47:52,516 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:47:52,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:47:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:47:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2020-07-18 00:47:52,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:52,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2020-07-18 00:47:52,625 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2020-07-18 00:47:52,625 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2020-07-18 00:47:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:52,628 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-18 00:47:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-18 00:47:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:52,629 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2020-07-18 00:47:52,629 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2020-07-18 00:47:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:52,632 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-18 00:47:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-18 00:47:52,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:52,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:52,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:52,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-18 00:47:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-18 00:47:52,636 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2020-07-18 00:47:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:52,636 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-18 00:47:52,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:47:52,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-18 00:47:52,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-18 00:47:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:47:52,691 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:52,691 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 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-18 00:47:52,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:47:52,692 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1612602333, now seen corresponding path program 1 times [2020-07-18 00:47:52,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:52,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134581769] [2020-07-18 00:47:52,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:47:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:47:52,827 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:52,827 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 00:47:52,827 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 00:47:52,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:47:52,846 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 00:47:52,846 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:47:52,846 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 00:47:52,847 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:47:52,847 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 00:47:52,847 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 00:47:52,847 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-18 00:47:52,848 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-18 00:47:52,849 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-18 00:47:52,850 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-18 00:47:52,851 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-18 00:47:52,852 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 00:47:52,853 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 00:47:52,853 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 00:47:52,853 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 00:47:52,853 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 00:47:52,853 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:47:52,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:47:52 BoogieIcfgContainer [2020-07-18 00:47:52,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:47:52,867 INFO L168 Benchmark]: Toolchain (without parser) took 4067.71 ms. Allocated memory was 140.0 MB in the beginning and 254.8 MB in the end (delta: 114.8 MB). Free memory was 99.9 MB in the beginning and 198.1 MB in the end (delta: -98.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,869 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 119.1 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.73 ms. Allocated memory is still 140.0 MB. Free memory was 99.7 MB in the beginning and 89.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,872 INFO L168 Benchmark]: Boogie Preprocessor took 129.89 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 89.8 MB in the beginning and 178.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,879 INFO L168 Benchmark]: RCFGBuilder took 431.34 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 158.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,884 INFO L168 Benchmark]: TraceAbstraction took 3205.07 ms. Allocated memory was 199.8 MB in the beginning and 254.8 MB in the end (delta: 55.1 MB). Free memory was 157.4 MB in the beginning and 198.1 MB in the end (delta: -40.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:52,892 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.24 ms. Allocated memory is still 140.0 MB. Free memory was 119.1 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.73 ms. Allocated memory is still 140.0 MB. Free memory was 99.7 MB in the beginning and 89.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.89 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 89.8 MB in the beginning and 178.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.34 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 158.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3205.07 ms. Allocated memory was 199.8 MB in the beginning and 254.8 MB in the end (delta: 55.1 MB). Free memory was 157.4 MB in the beginning and 198.1 MB in the end (delta: -40.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 [L20] COND TRUE i