/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/gcd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 04:51:08,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 04:51:08,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 04:51:08,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 04:51:08,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 04:51:08,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 04:51:08,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 04:51:08,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 04:51:08,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 04:51:08,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 04:51:08,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 04:51:08,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 04:51:08,420 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 04:51:08,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 04:51:08,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 04:51:08,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 04:51:08,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 04:51:08,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 04:51:08,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 04:51:08,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 04:51:08,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 04:51:08,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 04:51:08,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 04:51:08,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 04:51:08,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 04:51:08,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 04:51:08,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 04:51:08,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 04:51:08,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 04:51:08,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 04:51:08,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 04:51:08,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 04:51:08,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 04:51:08,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 04:51:08,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 04:51:08,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 04:51:08,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 04:51:08,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 04:51:08,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 04:51:08,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 04:51:08,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 04:51:08,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 04:51:08,471 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 04:51:08,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 04:51:08,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 04:51:08,474 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 04:51:08,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 04:51:08,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 04:51:08,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 04:51:08,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 04:51:08,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 04:51:08,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 04:51:08,476 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 04:51:08,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 04:51:08,476 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 04:51:08,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 04:51:08,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 04:51:08,479 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 04:51:08,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 04:51:08,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 04:51:08,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 04:51:08,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 04:51:08,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 04:51:08,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 04:51:08,481 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 04:51:08,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 04:51:08,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 04:51:08,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 04:51:08,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 04:51:08,978 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 04:51:08,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/gcd01-1.c [2020-11-07 04:51:09,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be47273c4/8bbe445cd43b4388be8b3df2de2cf81f/FLAG217bc7980 [2020-11-07 04:51:09,737 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 04:51:09,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-11-07 04:51:09,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be47273c4/8bbe445cd43b4388be8b3df2de2cf81f/FLAG217bc7980 [2020-11-07 04:51:10,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be47273c4/8bbe445cd43b4388be8b3df2de2cf81f [2020-11-07 04:51:10,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 04:51:10,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 04:51:10,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 04:51:10,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 04:51:10,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 04:51:10,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da74b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10, skipping insertion in model container [2020-11-07 04:51:10,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 04:51:10,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 04:51:10,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:51:10,322 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 04:51:10,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 04:51:10,361 INFO L208 MainTranslator]: Completed translation [2020-11-07 04:51:10,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10 WrapperNode [2020-11-07 04:51:10,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 04:51:10,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 04:51:10,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 04:51:10,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 04:51:10,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (1/1) ... [2020-11-07 04:51:10,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 04:51:10,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 04:51:10,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 04:51:10,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 04:51:10,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (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-11-07 04:51:10,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 04:51:10,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 04:51:10,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 04:51:10,489 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-11-07 04:51:10,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 04:51:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 04:51:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 04:51:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 04:51:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 04:51:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 04:51:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 04:51:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 04:51:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 04:51:10,788 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 04:51:10,788 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 04:51:10,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:10 BoogieIcfgContainer [2020-11-07 04:51:10,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 04:51:10,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 04:51:10,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 04:51:10,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 04:51:10,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:10" (1/3) ... [2020-11-07 04:51:10,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb2c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:10, skipping insertion in model container [2020-11-07 04:51:10,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:10" (2/3) ... [2020-11-07 04:51:10,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb2c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:10, skipping insertion in model container [2020-11-07 04:51:10,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:10" (3/3) ... [2020-11-07 04:51:10,824 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-11-07 04:51:10,848 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 04:51:10,885 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 04:51:10,912 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 04:51:10,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 04:51:10,968 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 04:51:10,968 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 04:51:10,969 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 04:51:10,970 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 04:51:10,970 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 04:51:10,971 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 04:51:10,971 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 04:51:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-11-07 04:51:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 04:51:11,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:11,030 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, 1, 1, 1, 1, 1] [2020-11-07 04:51:11,031 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -559339146, now seen corresponding path program 1 times [2020-11-07 04:51:11,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:11,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891519700] [2020-11-07 04:51:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:11,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:11,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:51:11,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891519700] [2020-11-07 04:51:11,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:11,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:51:11,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464689109] [2020-11-07 04:51:11,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:11,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:11,644 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 8 states. [2020-11-07 04:51:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:12,187 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2020-11-07 04:51:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:51:12,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-11-07 04:51:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:12,201 INFO L225 Difference]: With dead ends: 73 [2020-11-07 04:51:12,201 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 04:51:12,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:51:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 04:51:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 04:51:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 04:51:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2020-11-07 04:51:12,268 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 33 [2020-11-07 04:51:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:12,269 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2020-11-07 04:51:12,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-11-07 04:51:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 04:51:12,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:12,273 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, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:12,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 04:51:12,273 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1934950555, now seen corresponding path program 1 times [2020-11-07 04:51:12,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:12,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1317099631] [2020-11-07 04:51:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 04:51:12,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1317099631] [2020-11-07 04:51:12,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:12,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 04:51:12,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705794749] [2020-11-07 04:51:12,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 04:51:12,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 04:51:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 04:51:12,410 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 7 states. [2020-11-07 04:51:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:12,798 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-11-07 04:51:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:51:12,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-11-07 04:51:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:12,801 INFO L225 Difference]: With dead ends: 56 [2020-11-07 04:51:12,802 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 04:51:12,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 04:51:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 04:51:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-11-07 04:51:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 04:51:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2020-11-07 04:51:12,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2020-11-07 04:51:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:12,821 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2020-11-07 04:51:12,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 04:51:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-11-07 04:51:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 04:51:12,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:12,823 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:12,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 04:51:12,824 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1765277799, now seen corresponding path program 1 times [2020-11-07 04:51:12,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:12,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334673795] [2020-11-07 04:51:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 04:51:12,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1334673795] [2020-11-07 04:51:12,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:12,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:51:12,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602843872] [2020-11-07 04:51:12,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:12,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:12,975 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2020-11-07 04:51:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:13,321 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2020-11-07 04:51:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 04:51:13,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-11-07 04:51:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:13,324 INFO L225 Difference]: With dead ends: 66 [2020-11-07 04:51:13,324 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 04:51:13,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 04:51:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 04:51:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-11-07 04:51:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 04:51:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-11-07 04:51:13,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 44 [2020-11-07 04:51:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:13,343 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-11-07 04:51:13,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-11-07 04:51:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 04:51:13,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:13,345 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:13,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 04:51:13,346 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1722820979, now seen corresponding path program 1 times [2020-11-07 04:51:13,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:13,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [123106439] [2020-11-07 04:51:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:13,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:13,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:13,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 04:51:13,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [123106439] [2020-11-07 04:51:13,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:13,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 04:51:13,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900483190] [2020-11-07 04:51:13,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:51:13,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:51:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:51:13,600 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2020-11-07 04:51:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:13,955 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2020-11-07 04:51:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 04:51:13,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2020-11-07 04:51:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:13,957 INFO L225 Difference]: With dead ends: 66 [2020-11-07 04:51:13,957 INFO L226 Difference]: Without dead ends: 48 [2020-11-07 04:51:13,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:51:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-07 04:51:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-11-07 04:51:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-07 04:51:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-11-07 04:51:13,972 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 44 [2020-11-07 04:51:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:13,972 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-11-07 04:51:13,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:51:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-11-07 04:51:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 04:51:13,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:13,975 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:13,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 04:51:13,975 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash -738326546, now seen corresponding path program 1 times [2020-11-07 04:51:13,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:13,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380363332] [2020-11-07 04:51:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 04:51:14,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380363332] [2020-11-07 04:51:14,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:14,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:51:14,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119297088] [2020-11-07 04:51:14,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:14,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:14,110 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2020-11-07 04:51:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:14,566 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-11-07 04:51:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:51:14,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 04:51:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:14,569 INFO L225 Difference]: With dead ends: 58 [2020-11-07 04:51:14,571 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 04:51:14,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:51:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 04:51:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-11-07 04:51:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 04:51:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-11-07 04:51:14,605 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 45 [2020-11-07 04:51:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:14,606 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-11-07 04:51:14,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-11-07 04:51:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 04:51:14,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:14,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:14,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 04:51:14,612 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1742986130, now seen corresponding path program 1 times [2020-11-07 04:51:14,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:14,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391371166] [2020-11-07 04:51:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 04:51:14,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391371166] [2020-11-07 04:51:14,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:14,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 04:51:14,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708410989] [2020-11-07 04:51:14,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 04:51:14,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 04:51:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 04:51:14,780 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 8 states. [2020-11-07 04:51:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:15,248 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2020-11-07 04:51:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 04:51:15,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 04:51:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:15,250 INFO L225 Difference]: With dead ends: 63 [2020-11-07 04:51:15,250 INFO L226 Difference]: Without dead ends: 56 [2020-11-07 04:51:15,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-11-07 04:51:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-07 04:51:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-07 04:51:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 04:51:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-11-07 04:51:15,273 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 45 [2020-11-07 04:51:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:15,274 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-11-07 04:51:15,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 04:51:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-11-07 04:51:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-07 04:51:15,276 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 04:51:15,276 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 04:51:15,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 04:51:15,276 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 04:51:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 04:51:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1509136149, now seen corresponding path program 1 times [2020-11-07 04:51:15,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 04:51:15,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718622861] [2020-11-07 04:51:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 04:51:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:15,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 04:51:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:15,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 04:51:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:15,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:15,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-07 04:51:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 04:51:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 04:51:15,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718622861] [2020-11-07 04:51:15,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 04:51:15,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 04:51:15,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733160684] [2020-11-07 04:51:15,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 04:51:15,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 04:51:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 04:51:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 04:51:15,433 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 9 states. [2020-11-07 04:51:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 04:51:15,877 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-11-07 04:51:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 04:51:15,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2020-11-07 04:51:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 04:51:15,877 INFO L225 Difference]: With dead ends: 56 [2020-11-07 04:51:15,877 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 04:51:15,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-11-07 04:51:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 04:51:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 04:51:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 04:51:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 04:51:15,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2020-11-07 04:51:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 04:51:15,880 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 04:51:15,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 04:51:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 04:51:15,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 04:51:15,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 04:51:15,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 04:51:16,910 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2020-11-07 04:51:17,187 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,187 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,187 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,188 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,188 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,189 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 04:51:17,190 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,191 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 04:51:17,191 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,191 INFO L262 CegarLoopResult]: At program point gcdFINAL(lines 17 28) the Hoare annotation is: (let ((.cse0 (= gcd_~y2 |gcd_#in~y2|)) (.cse1 (= gcd_~y1 |gcd_#in~y1|))) (or (and (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0)) .cse0 .cse1) (and (<= 1 |gcd_#res|) .cse0 .cse1))) [2020-11-07 04:51:17,191 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,191 INFO L262 CegarLoopResult]: At program point gcdEXIT(lines 17 28) the Hoare annotation is: (let ((.cse0 (= gcd_~y2 |gcd_#in~y2|)) (.cse1 (= gcd_~y1 |gcd_#in~y1|))) (or (and (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0)) .cse0 .cse1) (and (<= 1 |gcd_#res|) .cse0 .cse1))) [2020-11-07 04:51:17,192 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 1 |gcd_#t~ret8|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,192 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 1 gcd_~y2) (<= (+ gcd_~y2 1) gcd_~y1) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|)) [2020-11-07 04:51:17,194 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 1 |gcd_#t~ret8|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,194 INFO L262 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y2) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,194 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 1 gcd_~y2) (<= (+ gcd_~y2 1) gcd_~y1) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 |gcd_#t~ret7|)) [2020-11-07 04:51:17,195 INFO L262 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 1 |gcd_#res|) (<= 1 |gcd_#t~ret8|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,195 INFO L269 CegarLoopResult]: At program point gcdENTRY(lines 17 28) the Hoare annotation is: true [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 1 gcd_~y2) (<= (+ gcd_~y2 1) gcd_~y1) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 |gcd_#t~ret7|)) [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 1 gcd_~y2) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= 1 gcd_~y2) (<= 1 |gcd_#res|) (<= (+ gcd_~y2 1) gcd_~y1) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 |gcd_#t~ret7|)) [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L21(lines 21 23) the Hoare annotation is: (and (<= 1 gcd_~y2) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0)) (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|)) [2020-11-07 04:51:17,196 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (and (= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|)) [2020-11-07 04:51:17,197 INFO L262 CegarLoopResult]: At program point L17(lines 17 28) the Hoare annotation is: (= gcd_~y1 |gcd_#in~y1|) [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 04:51:17,197 INFO L262 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: (<= 1 main_~m~0) [2020-11-07 04:51:17,197 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 04:51:17,198 INFO L269 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-11-07 04:51:17,198 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 30 45) the Hoare annotation is: true [2020-11-07 04:51:17,198 INFO L262 CegarLoopResult]: At program point L40(lines 40 44) the Hoare annotation is: (and (<= 1 main_~n~0) (<= 1 main_~z~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,198 INFO L269 CegarLoopResult]: At program point L40-1(lines 30 45) the Hoare annotation is: true [2020-11-07 04:51:17,198 INFO L262 CegarLoopResult]: At program point L36(lines 36 38) the Hoare annotation is: (<= 1 main_~m~0) [2020-11-07 04:51:17,198 INFO L269 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-11-07 04:51:17,198 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 30 45) the Hoare annotation is: true [2020-11-07 04:51:17,199 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= 1 main_~n~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,199 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 04:51:17,199 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 04:51:17,203 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 main_~n~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,204 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= 1 main_~n~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,204 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (<= 1 main_~m~0) [2020-11-07 04:51:17,204 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= 1 main_~n~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,204 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 1 |main_#t~ret11|) (<= 1 main_~n~0) (<= 1 main_~z~0) (<= 1 main_~m~0)) [2020-11-07 04:51:17,204 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (<= 1 main_~m~0) [2020-11-07 04:51:17,205 INFO L262 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (<= 1 main_~m~0) [2020-11-07 04:51:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:51:17 BoogieIcfgContainer [2020-11-07 04:51:17,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 04:51:17,242 INFO L168 Benchmark]: Toolchain (without parser) took 7139.37 ms. Allocated memory was 161.5 MB in the beginning and 232.8 MB in the end (delta: 71.3 MB). Free memory was 137.6 MB in the beginning and 95.2 MB in the end (delta: 42.5 MB). Peak memory consumption was 130.6 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:17,244 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 161.5 MB. Free memory is still 134.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 04:51:17,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.91 ms. Allocated memory is still 161.5 MB. Free memory was 137.0 MB in the beginning and 127.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:17,253 INFO L168 Benchmark]: Boogie Preprocessor took 34.97 ms. Allocated memory is still 161.5 MB. Free memory was 127.8 MB in the beginning and 126.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:17,254 INFO L168 Benchmark]: RCFGBuilder took 398.36 ms. Allocated memory is still 161.5 MB. Free memory was 126.4 MB in the beginning and 110.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:17,255 INFO L168 Benchmark]: TraceAbstraction took 6435.23 ms. Allocated memory was 161.5 MB in the beginning and 232.8 MB in the end (delta: 71.3 MB). Free memory was 110.2 MB in the beginning and 95.2 MB in the end (delta: 15.1 MB). Peak memory consumption was 103.4 MB. Max. memory is 8.0 GB. [2020-11-07 04:51:17,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 161.5 MB. Free memory is still 134.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 252.91 ms. Allocated memory is still 161.5 MB. Free memory was 137.0 MB in the beginning and 127.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.97 ms. Allocated memory is still 161.5 MB. Free memory was 127.8 MB in the beginning and 126.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 398.36 ms. Allocated memory is still 161.5 MB. Free memory was 126.4 MB in the beginning and 110.7 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6435.23 ms. Allocated memory was 161.5 MB in the beginning and 232.8 MB in the end (delta: 71.3 MB). Free memory was 110.2 MB in the beginning and 95.2 MB in the end (delta: 15.1 MB). Peak memory consumption was 103.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for gcd Derived contract for procedure gcd: (((\old(y2) <= 0 || \old(y1) <= 0) && y2 == \old(y2)) && y1 == \old(y1)) || ((1 <= \result && y2 == \old(y2)) && y1 == \old(y1)) - ProcedureContractResult [Line: 30]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 428 SDslu, 485 SDs, 0 SdLazy, 1015 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 113 PreInvPairs, 175 NumberOfFragments, 383 HoareAnnotationTreeSize, 113 FomulaSimplifications, 6110 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 55 FomulaSimplificationsInter, 1851 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 41/41 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...