/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:58,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:58,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:58,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:58,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:58,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:58,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:58,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:58,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:58,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:58,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:58,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:58,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:58,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:58,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:58,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:58,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:58,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:58,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:58,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:58,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:58,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:58,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:58,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:58,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:58,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:58,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:58,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:58,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:58,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:58,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:58,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:58,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:58,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:58,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:58,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:58,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:58,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:58,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:58,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:58,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:58,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:58,435 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:58,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:58,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:58,437 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:58,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:58,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:58,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:58,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:58,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:58,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:58,440 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:58,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:58,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:58,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:58,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:58,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:58,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:58,441 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:58,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:58,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:58,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:58,764 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:58,765 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:58,766 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-10 20:24:58,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e45591f2/d8a3db9769be4593bc92ad872ff18e38/FLAG7058010b7 [2020-07-10 20:24:59,291 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:59,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-10 20:24:59,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e45591f2/d8a3db9769be4593bc92ad872ff18e38/FLAG7058010b7 [2020-07-10 20:24:59,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e45591f2/d8a3db9769be4593bc92ad872ff18e38 [2020-07-10 20:24:59,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:59,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:59,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:59,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:59,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:59,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:59" (1/1) ... [2020-07-10 20:24:59,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ff5ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:59, skipping insertion in model container [2020-07-10 20:24:59,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:59" (1/1) ... [2020-07-10 20:24:59,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:59,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:59,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:59,962 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:59,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:00,000 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:25:00,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00 WrapperNode [2020-07-10 20:25:00,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:00,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:25:00,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:25:00,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... [2020-07-10 20:25:00,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:25:00,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:25:00,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:25:00,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:25:00,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:25:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:25:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:25:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:25:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:25:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:25:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:25:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:25:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:25:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:25:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:25:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:25:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:25:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:25:00,569 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:25:00,569 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:25:00,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:00 BoogieIcfgContainer [2020-07-10 20:25:00,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:25:00,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:25:00,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:25:00,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:25:00,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:59" (1/3) ... [2020-07-10 20:25:00,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ee143f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:00" (2/3) ... [2020-07-10 20:25:00,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ee143f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:00, skipping insertion in model container [2020-07-10 20:25:00,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:00" (3/3) ... [2020-07-10 20:25:00,583 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.i [2020-07-10 20:25:00,594 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:25:00,601 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:25:00,615 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:25:00,636 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:25:00,636 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:25:00,636 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:25:00,636 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:25:00,636 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:25:00,637 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:25:00,637 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:25:00,637 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:25:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 20:25:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:25:00,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:00,666 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-10 20:25:00,667 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -47870921, now seen corresponding path program 1 times [2020-07-10 20:25:00,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:00,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983772862] [2020-07-10 20:25:00,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:01,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 20:25:01,164 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-10 20:25:01,167 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2020-07-10 20:25:01,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 20:25:01,168 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-10 20:25:01,168 INFO L263 TraceCheckUtils]: 3: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2020-07-10 20:25:01,169 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#true} havoc ~i~0; {39#true} is VALID [2020-07-10 20:25:01,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~j~0; {39#true} is VALID [2020-07-10 20:25:01,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {39#true} is VALID [2020-07-10 20:25:01,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} ~i~0 := #t~nondet0; {39#true} is VALID [2020-07-10 20:25:01,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} havoc #t~nondet0; {39#true} is VALID [2020-07-10 20:25:01,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {39#true} is VALID [2020-07-10 20:25:01,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} ~j~0 := #t~nondet1; {39#true} is VALID [2020-07-10 20:25:01,172 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} havoc #t~nondet1; {39#true} is VALID [2020-07-10 20:25:01,172 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} assume !!(~i~0 >= 0 && ~j~0 >= 0); {39#true} is VALID [2020-07-10 20:25:01,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#true} ~x~0 := ~i~0; {43#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-10 20:25:01,176 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {44#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 20:25:01,177 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume !(0 != ~x~0); {45#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 20:25:01,179 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {46#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-10 20:25:01,182 INFO L263 TraceCheckUtils]: 17: Hoare triple {46#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {47#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:01,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {48#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:01,184 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40#false} is VALID [2020-07-10 20:25:01,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 20:25:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:01,189 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:01,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983772862] [2020-07-10 20:25:01,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:01,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:25:01,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324299867] [2020-07-10 20:25:01,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 20:25:01,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:01,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:25:01,246 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-10 20:25:01,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:25:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:25:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:25:01,261 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 8 states. [2020-07-10 20:25:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:02,000 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-07-10 20:25:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:25:02,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 20:25:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:25:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-10 20:25:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:25:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-10 20:25:02,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2020-07-10 20:25:02,118 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-10 20:25:02,130 INFO L225 Difference]: With dead ends: 64 [2020-07-10 20:25:02,131 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 20:25:02,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:25:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 20:25:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-10 20:25:02,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:02,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-10 20:25:02,191 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-10 20:25:02,191 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-10 20:25:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:02,195 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-10 20:25:02,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:02,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:02,197 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-10 20:25:02,197 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-10 20:25:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:02,201 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-10 20:25:02,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:02,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:02,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:02,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 20:25:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-10 20:25:02,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2020-07-10 20:25:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:02,208 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-10 20:25:02,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:25:02,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2020-07-10 20:25:02,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 20:25:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 20:25:02,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:02,248 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, 1, 1, 1, 1] [2020-07-10 20:25:02,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:25:02,249 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash -999978286, now seen corresponding path program 1 times [2020-07-10 20:25:02,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:02,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319380437] [2020-07-10 20:25:02,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-10 20:25:02,706 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {307#true} {307#true} #67#return; {307#true} is VALID [2020-07-10 20:25:02,706 INFO L263 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2020-07-10 20:25:02,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-10 20:25:02,707 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #67#return; {307#true} is VALID [2020-07-10 20:25:02,707 INFO L263 TraceCheckUtils]: 3: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2020-07-10 20:25:02,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#true} havoc ~i~0; {307#true} is VALID [2020-07-10 20:25:02,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~j~0; {307#true} is VALID [2020-07-10 20:25:02,708 INFO L280 TraceCheckUtils]: 6: Hoare triple {307#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {307#true} is VALID [2020-07-10 20:25:02,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {307#true} ~i~0 := #t~nondet0; {307#true} is VALID [2020-07-10 20:25:02,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#true} havoc #t~nondet0; {307#true} is VALID [2020-07-10 20:25:02,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {307#true} is VALID [2020-07-10 20:25:02,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#true} ~j~0 := #t~nondet1; {307#true} is VALID [2020-07-10 20:25:02,710 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#true} havoc #t~nondet1; {307#true} is VALID [2020-07-10 20:25:02,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#true} assume !!(~i~0 >= 0 && ~j~0 >= 0); {307#true} is VALID [2020-07-10 20:25:02,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#true} ~x~0 := ~i~0; {311#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-10 20:25:02,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {311#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-10 20:25:02,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} assume !!(0 != ~x~0); {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-10 20:25:02,715 INFO L280 TraceCheckUtils]: 16: Hoare triple {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} #t~post2 := ~x~0; {313#(and (<= (+ main_~i~0 main_~y~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~i~0 main_~y~0)))} is VALID [2020-07-10 20:25:02,717 INFO L280 TraceCheckUtils]: 17: Hoare triple {313#(and (<= (+ main_~i~0 main_~y~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~i~0 main_~y~0)))} ~x~0 := #t~post2 - 1; {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-10 20:25:02,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} havoc #t~post2; {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-10 20:25:02,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} #t~post3 := ~y~0; {315#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 |main_#t~post3|)) (<= (+ main_~i~0 |main_#t~post3|) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-10 20:25:02,722 INFO L280 TraceCheckUtils]: 20: Hoare triple {315#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 |main_#t~post3|)) (<= (+ main_~i~0 |main_#t~post3|) (+ main_~x~0 main_~j~0 1)))} ~y~0 := #t~post3 - 1; {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 20:25:02,724 INFO L280 TraceCheckUtils]: 21: Hoare triple {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} havoc #t~post3; {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 20:25:02,726 INFO L280 TraceCheckUtils]: 22: Hoare triple {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume !(0 != ~x~0); {317#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-10 20:25:02,728 INFO L280 TraceCheckUtils]: 23: Hoare triple {317#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {318#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-10 20:25:02,729 INFO L263 TraceCheckUtils]: 24: Hoare triple {318#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {319#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:02,730 INFO L280 TraceCheckUtils]: 25: Hoare triple {319#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {320#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:02,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {320#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {308#false} is VALID [2020-07-10 20:25:02,732 INFO L280 TraceCheckUtils]: 27: Hoare triple {308#false} assume !false; {308#false} is VALID [2020-07-10 20:25:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:25:02,735 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:02,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319380437] [2020-07-10 20:25:02,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:02,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:25:02,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308514461] [2020-07-10 20:25:02,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 20:25:02,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:02,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:25:02,773 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-10 20:25:02,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:25:02,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:25:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:25:02,774 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2020-07-10 20:25:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,412 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-10 20:25:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:25:03,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-10 20:25:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:25:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2020-07-10 20:25:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:25:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2020-07-10 20:25:03,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 31 transitions. [2020-07-10 20:25:03,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:03,469 INFO L225 Difference]: With dead ends: 31 [2020-07-10 20:25:03,469 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:25:03,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:25:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:25:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:25:03,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:03,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:03,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:03,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,473 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:03,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:03,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:03,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:03,474 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:03,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:03,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:03,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:03,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:03,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:25:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:25:03,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-10 20:25:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:03,476 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:25:03,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:25:03,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:25:03,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:03,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:03,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:25:03,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:25:03,785 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,786 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:03,787 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:03,787 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:03,787 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:25:03,787 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:25:03,787 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:03,788 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse2 (<= main_~y~0 0)) (.cse3 (< 0 (+ main_~y~0 1)))) (or (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 .cse3)) (and (<= main_~i~0 main_~x~0) .cse2 (<= main_~x~0 main_~i~0) .cse3))) [2020-07-10 20:25:03,788 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 28) the Hoare annotation is: true [2020-07-10 20:25:03,788 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:03,788 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 main_~j~0)) (.cse1 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse0 .cse2) (<= .cse1 .cse0))) [2020-07-10 20:25:03,788 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0)) [2020-07-10 20:25:03,789 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 main_~j~0 1)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse1 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 .cse2) (<= .cse2 .cse1))) [2020-07-10 20:25:03,789 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:25:03,789 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:25:03,789 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:25:03,789 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 20:25:03,789 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 20:25:03,790 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 28) the Hoare annotation is: true [2020-07-10 20:25:03,790 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 28) the Hoare annotation is: true [2020-07-10 20:25:03,790 INFO L271 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: true [2020-07-10 20:25:03,790 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:03,790 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse2 (+ main_~i~0 |main_#t~post3|)) (.cse0 (+ main_~x~0 main_~j~0 1))) (and (<= .cse0 .cse1) (<= .cse0 .cse2) (<= .cse1 .cse0) (<= .cse2 .cse0))) [2020-07-10 20:25:03,791 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 |main_#t~post3|)) (.cse0 (+ main_~x~0 main_~j~0 1)) (.cse3 (+ main_~i~0 main_~y~0)) (.cse2 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse2 .cse3) (<= .cse3 .cse2))) [2020-07-10 20:25:03,791 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:25:03,791 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 23) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-10 20:25:03,791 INFO L264 CegarLoopResult]: At program point L20-3(lines 13 28) the Hoare annotation is: (let ((.cse5 (< 0 (+ main_~y~0 1))) (.cse4 (<= main_~y~0 0)) (.cse6 (+ main_~i~0 main_~y~0)) (.cse7 (+ main_~x~0 main_~j~0))) (let ((.cse1 (<= .cse6 .cse7)) (.cse0 (<= .cse7 .cse6)) (.cse2 (or (<= .cse6 main_~j~0) .cse4)) (.cse3 (or (<= main_~j~0 .cse6) .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or .cse1 .cse4) (<= main_~i~0 main_~x~0) (or .cse0 .cse5) .cse2 (<= main_~x~0 main_~i~0) .cse3)))) [2020-07-10 20:25:03,791 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:25:03,792 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:25:03,792 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:25:03,792 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-10 20:25:03,792 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:03,792 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:25:03,792 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:03,792 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:25:03,793 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:25:03,793 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:03,798 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:25:03,799 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:03,800 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:03,800 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:25:03,801 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:25:03,823 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:25:03,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:25:03 BoogieIcfgContainer [2020-07-10 20:25:03,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:25:03,848 INFO L168 Benchmark]: Toolchain (without parser) took 4155.97 ms. Allocated memory was 137.9 MB in the beginning and 249.0 MB in the end (delta: 111.1 MB). Free memory was 102.8 MB in the beginning and 184.8 MB in the end (delta: -82.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,849 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.70 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,851 INFO L168 Benchmark]: Boogie Preprocessor took 134.12 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 181.9 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,852 INFO L168 Benchmark]: RCFGBuilder took 435.11 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 161.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,853 INFO L168 Benchmark]: TraceAbstraction took 3269.45 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 160.6 MB in the beginning and 184.8 MB in the end (delta: -24.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:03,858 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.26 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.70 ms. Allocated memory is still 137.9 MB. Free memory was 102.6 MB in the beginning and 92.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 134.12 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 181.9 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 435.11 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 161.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3269.45 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 160.6 MB in the beginning and 184.8 MB in the end (delta: -24.2 MB). Peak memory consumption was 23.0 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: 20]: Loop Invariant Derived loop invariant: x + j <= i + y && i + y <= x + j - 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: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 40 SDslu, 253 SDs, 0 SdLazy, 177 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 48 PreInvPairs, 70 NumberOfFragments, 355 HoareAnnotationTreeSize, 48 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 36 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...