/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-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:53:07,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:53:07,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:53:07,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:53:07,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:53:07,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:53:07,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:53:07,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:53:07,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:53:07,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:53:07,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:53:07,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:53:07,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:53:07,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:53:07,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:53:07,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:53:07,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:53:07,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:53:07,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:53:07,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:53:07,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:53:07,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:53:07,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:53:07,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:53:07,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:53:07,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:53:07,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:53:07,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:53:07,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:53:07,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:53:07,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:53:07,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:53:07,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:53:07,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:53:07,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:53:07,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:53:07,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:53:07,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:53:07,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:53:07,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:53:07,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:53:07,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:53:07,433 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:53:07,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:53:07,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:53:07,436 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:53:07,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:53:07,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:53:07,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:53:07,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:53:07,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:53:07,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:53:07,438 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:53:07,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:53:07,438 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:53:07,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:53:07,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:53:07,439 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:53:07,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:53:07,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:53:07,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:07,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:53:07,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:53:07,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:53:07,441 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-10-24 00:53:07,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:53:07,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:53:07,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:53:07,896 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:53:07,897 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:53:07,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-10-24 00:53:07,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed279a06/c8c831c46ea54c288e9fb5c6ea650bf1/FLAG8c75a5c58 [2020-10-24 00:53:08,693 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:53:08,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-10-24 00:53:08,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed279a06/c8c831c46ea54c288e9fb5c6ea650bf1/FLAG8c75a5c58 [2020-10-24 00:53:09,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eed279a06/c8c831c46ea54c288e9fb5c6ea650bf1 [2020-10-24 00:53:09,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:53:09,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:53:09,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:09,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:53:09,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:53:09,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc15e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09, skipping insertion in model container [2020-10-24 00:53:09,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:53:09,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:53:09,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:09,330 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:53:09,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:09,375 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:53:09,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09 WrapperNode [2020-10-24 00:53:09,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:09,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:53:09,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:53:09,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:53:09,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (1/1) ... [2020-10-24 00:53:09,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:53:09,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:53:09,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:53:09,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:53:09,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (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-10-24 00:53:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:53:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:53:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:53:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:53:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:53:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:53:09,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:53:09,563 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:53:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:53:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:53:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:53:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:53:09,564 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:53:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:53:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:53:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:53:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:53:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:53:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:53:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:53:10,179 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:53:10,180 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:53:10,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:10 BoogieIcfgContainer [2020-10-24 00:53:10,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:53:10,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:53:10,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:53:10,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:53:10,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:53:09" (1/3) ... [2020-10-24 00:53:10,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0c6375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:10, skipping insertion in model container [2020-10-24 00:53:10,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:09" (2/3) ... [2020-10-24 00:53:10,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0c6375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:10, skipping insertion in model container [2020-10-24 00:53:10,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:10" (3/3) ... [2020-10-24 00:53:10,199 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-10-24 00:53:10,235 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:53:10,245 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:53:10,262 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:53:10,294 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:53:10,295 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:53:10,295 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:53:10,295 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:53:10,295 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:53:10,295 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:53:10,296 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:53:10,296 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:53:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:53:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:53:10,328 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:10,330 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] [2020-10-24 00:53:10,330 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:53:10,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:10,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443238622] [2020-10-24 00:53:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:10,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:10,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443238622] [2020-10-24 00:53:10,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:10,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:10,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744974113] [2020-10-24 00:53:10,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:10,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:10,797 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:53:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:11,344 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-10-24 00:53:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:11,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:53:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:11,359 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:53:11,359 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:53:11,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:53:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:53:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:53:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:53:11,435 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:53:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:11,436 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:53:11,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:53:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:53:11,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:11,439 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] [2020-10-24 00:53:11,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:53:11,440 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:53:11,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:11,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1591126218] [2020-10-24 00:53:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:11,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:11,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:11,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1591126218] [2020-10-24 00:53:11,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:11,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:11,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031350869] [2020-10-24 00:53:11,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:11,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:11,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:11,588 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:53:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:11,975 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:53:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:11,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:53:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:11,994 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:53:11,994 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:53:11,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:53:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:53:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:53:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:53:12,047 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:53:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:12,048 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:53:12,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:53:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:53:12,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:12,053 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] [2020-10-24 00:53:12,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:53:12,054 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:12,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:53:12,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:12,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1161128037] [2020-10-24 00:53:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:53:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:53:12,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1161128037] [2020-10-24 00:53:12,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:12,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:12,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954753017] [2020-10-24 00:53:12,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:12,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:12,362 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-10-24 00:53:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:12,842 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:53:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:12,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:53:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:12,846 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:53:12,846 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:53:12,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:53:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:53:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:53:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:53:12,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:53:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:12,871 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:53:12,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:53:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:53:12,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:12,873 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-10-24 00:53:12,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:53:12,874 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:53:12,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:12,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981399038] [2020-10-24 00:53:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:12,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:13,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 00:53:13,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981399038] [2020-10-24 00:53:13,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:13,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:13,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206241584] [2020-10-24 00:53:13,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:13,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:13,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:13,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:13,037 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-10-24 00:53:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:13,777 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-24 00:53:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:53:13,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 00:53:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:13,784 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:53:13,785 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:53:13,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:53:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:53:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-10-24 00:53:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:53:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-10-24 00:53:13,832 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-10-24 00:53:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:13,833 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-24 00:53:13,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-10-24 00:53:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:53:13,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:13,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:13,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:53:13,851 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:53:13,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:13,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726859779] [2020-10-24 00:53:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:13,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:13,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:53:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:53:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:53:14,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726859779] [2020-10-24 00:53:14,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:14,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:14,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809070459] [2020-10-24 00:53:14,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:14,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:14,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:14,101 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-10-24 00:53:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:14,474 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-10-24 00:53:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:14,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-10-24 00:53:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:14,478 INFO L225 Difference]: With dead ends: 140 [2020-10-24 00:53:14,478 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:53:14,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:53:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:53:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:53:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-10-24 00:53:14,504 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-10-24 00:53:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:14,505 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-10-24 00:53:14,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-10-24 00:53:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:53:14,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:14,507 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:14,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:53:14,508 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:14,509 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:53:14,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:14,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657265531] [2020-10-24 00:53:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-10-24 00:53:14,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657265531] [2020-10-24 00:53:14,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:14,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:14,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530780669] [2020-10-24 00:53:14,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:14,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:14,680 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-10-24 00:53:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:15,261 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-10-24 00:53:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:15,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:53:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:15,268 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:53:15,269 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:53:15,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:53:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:53:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-10-24 00:53:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 00:53:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-10-24 00:53:15,322 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-10-24 00:53:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:15,322 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-10-24 00:53:15,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-10-24 00:53:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:53:15,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:15,327 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:15,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:53:15,328 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:53:15,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:15,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733452603] [2020-10-24 00:53:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-24 00:53:15,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733452603] [2020-10-24 00:53:15,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:15,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:53:15,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094932696] [2020-10-24 00:53:15,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:53:15,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:53:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:53:15,552 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-10-24 00:53:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:16,354 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-10-24 00:53:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:53:16,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:53:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:16,359 INFO L225 Difference]: With dead ends: 128 [2020-10-24 00:53:16,359 INFO L226 Difference]: Without dead ends: 121 [2020-10-24 00:53:16,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-24 00:53:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-10-24 00:53:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 00:53:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-10-24 00:53:16,395 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-10-24 00:53:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:16,395 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-10-24 00:53:16,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:53:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-10-24 00:53:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:53:16,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:16,398 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 00:53:16,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:53:16,399 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-10-24 00:53:16,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:16,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246463848] [2020-10-24 00:53:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 00:53:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:53:16,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246463848] [2020-10-24 00:53:16,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:16,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:53:16,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909028885] [2020-10-24 00:53:16,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:53:16,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:53:16,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:53:16,611 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-10-24 00:53:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:17,277 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-10-24 00:53:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:53:17,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-24 00:53:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:17,283 INFO L225 Difference]: With dead ends: 237 [2020-10-24 00:53:17,283 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:53:17,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:53:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:53:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 00:53:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:53:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-10-24 00:53:17,344 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-10-24 00:53:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:17,345 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-10-24 00:53:17,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:53:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-10-24 00:53:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:53:17,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:17,350 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 00:53:17,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:53:17,350 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-10-24 00:53:17,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:17,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1023811635] [2020-10-24 00:53:17,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-24 00:53:17,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1023811635] [2020-10-24 00:53:17,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:17,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:53:17,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335101951] [2020-10-24 00:53:17,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:53:17,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:53:17,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:17,619 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-10-24 00:53:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:18,387 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-10-24 00:53:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:53:18,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-24 00:53:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:18,394 INFO L225 Difference]: With dead ends: 267 [2020-10-24 00:53:18,395 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:53:18,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:53:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-10-24 00:53:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:53:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-10-24 00:53:18,457 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-10-24 00:53:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:18,459 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-10-24 00:53:18,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:53:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-10-24 00:53:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:53:18,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:18,464 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 00:53:18,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:53:18,464 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-10-24 00:53:18,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:18,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28186984] [2020-10-24 00:53:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-10-24 00:53:18,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28186984] [2020-10-24 00:53:18,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:18,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:53:18,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061425785] [2020-10-24 00:53:18,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:53:18,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:53:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:18,723 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-10-24 00:53:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:19,696 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-10-24 00:53:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:53:19,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-10-24 00:53:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:19,702 INFO L225 Difference]: With dead ends: 223 [2020-10-24 00:53:19,702 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 00:53:19,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:53:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 00:53:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-10-24 00:53:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-24 00:53:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-10-24 00:53:19,755 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-10-24 00:53:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:19,756 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-10-24 00:53:19,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:53:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-10-24 00:53:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-24 00:53:19,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:19,760 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 00:53:19,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:53:19,761 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-10-24 00:53:19,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:19,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982063578] [2020-10-24 00:53:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:53:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:19,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-10-24 00:53:20,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982063578] [2020-10-24 00:53:20,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:20,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:53:20,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670771520] [2020-10-24 00:53:20,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:53:20,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:53:20,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:53:20,020 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 10 states. [2020-10-24 00:53:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:20,860 INFO L93 Difference]: Finished difference Result 455 states and 768 transitions. [2020-10-24 00:53:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:53:20,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2020-10-24 00:53:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:20,868 INFO L225 Difference]: With dead ends: 455 [2020-10-24 00:53:20,868 INFO L226 Difference]: Without dead ends: 262 [2020-10-24 00:53:20,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-24 00:53:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2020-10-24 00:53:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-10-24 00:53:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2020-10-24 00:53:20,940 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 115 [2020-10-24 00:53:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:20,941 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2020-10-24 00:53:20,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:53:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2020-10-24 00:53:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-24 00:53:20,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:20,951 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-10-24 00:53:20,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:53:20,951 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:20,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:20,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1046535914, now seen corresponding path program 1 times [2020-10-24 00:53:20,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:20,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482780152] [2020-10-24 00:53:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:53:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:53:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 42 proven. 188 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2020-10-24 00:53:21,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482780152] [2020-10-24 00:53:21,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:21,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:53:21,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679292168] [2020-10-24 00:53:21,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:53:21,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:53:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:21,430 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 11 states. [2020-10-24 00:53:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:22,530 INFO L93 Difference]: Finished difference Result 359 states and 571 transitions. [2020-10-24 00:53:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:53:22,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2020-10-24 00:53:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:22,540 INFO L225 Difference]: With dead ends: 359 [2020-10-24 00:53:22,541 INFO L226 Difference]: Without dead ends: 352 [2020-10-24 00:53:22,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:53:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-10-24 00:53:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2020-10-24 00:53:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-10-24 00:53:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2020-10-24 00:53:22,678 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 185 [2020-10-24 00:53:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:22,679 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2020-10-24 00:53:22,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:53:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2020-10-24 00:53:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2020-10-24 00:53:22,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:22,688 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:22,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:53:22,689 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:22,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash -511149312, now seen corresponding path program 3 times [2020-10-24 00:53:22,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:22,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617250872] [2020-10-24 00:53:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:22,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:53:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 00:53:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:53:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 146 proven. 171 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2020-10-24 00:53:23,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617250872] [2020-10-24 00:53:23,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:23,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:53:23,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26367487] [2020-10-24 00:53:23,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:53:23,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:53:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:53:23,320 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 12 states. [2020-10-24 00:53:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:24,549 INFO L93 Difference]: Finished difference Result 766 states and 1451 transitions. [2020-10-24 00:53:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:53:24,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 222 [2020-10-24 00:53:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:24,562 INFO L225 Difference]: With dead ends: 766 [2020-10-24 00:53:24,562 INFO L226 Difference]: Without dead ends: 442 [2020-10-24 00:53:24,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:53:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-24 00:53:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 430. [2020-10-24 00:53:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-24 00:53:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 721 transitions. [2020-10-24 00:53:24,684 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 721 transitions. Word has length 222 [2020-10-24 00:53:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:24,684 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 721 transitions. [2020-10-24 00:53:24,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:53:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 721 transitions. [2020-10-24 00:53:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2020-10-24 00:53:24,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:24,697 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 15, 15, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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-10-24 00:53:24,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:53:24,697 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1369698103, now seen corresponding path program 4 times [2020-10-24 00:53:24,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:24,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669291386] [2020-10-24 00:53:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:24,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:24,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:24,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:24,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:24,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:53:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:53:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 00:53:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:53:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-10-24 00:53:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:53:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1894 backedges. 203 proven. 541 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2020-10-24 00:53:25,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669291386] [2020-10-24 00:53:25,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:25,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:53:25,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775649496] [2020-10-24 00:53:25,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:53:25,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:25,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:53:25,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:53:25,541 INFO L87 Difference]: Start difference. First operand 430 states and 721 transitions. Second operand 16 states. [2020-10-24 00:53:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:27,947 INFO L93 Difference]: Finished difference Result 745 states and 1361 transitions. [2020-10-24 00:53:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:53:27,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 313 [2020-10-24 00:53:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:27,956 INFO L225 Difference]: With dead ends: 745 [2020-10-24 00:53:27,956 INFO L226 Difference]: Without dead ends: 319 [2020-10-24 00:53:27,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=1296, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 00:53:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-24 00:53:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 291. [2020-10-24 00:53:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-10-24 00:53:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 418 transitions. [2020-10-24 00:53:28,043 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 418 transitions. Word has length 313 [2020-10-24 00:53:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:28,044 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 418 transitions. [2020-10-24 00:53:28,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:53:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 418 transitions. [2020-10-24 00:53:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-10-24 00:53:28,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:28,050 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:28,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:53:28,051 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -834000686, now seen corresponding path program 2 times [2020-10-24 00:53:28,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:28,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118160799] [2020-10-24 00:53:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:53:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-10-24 00:53:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 180 proven. 165 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2020-10-24 00:53:28,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118160799] [2020-10-24 00:53:28,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:28,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:53:28,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137092933] [2020-10-24 00:53:28,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:53:28,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:53:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:53:28,617 INFO L87 Difference]: Start difference. First operand 291 states and 418 transitions. Second operand 15 states. [2020-10-24 00:53:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:30,690 INFO L93 Difference]: Finished difference Result 608 states and 938 transitions. [2020-10-24 00:53:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:53:30,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 203 [2020-10-24 00:53:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:30,699 INFO L225 Difference]: With dead ends: 608 [2020-10-24 00:53:30,699 INFO L226 Difference]: Without dead ends: 334 [2020-10-24 00:53:30,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:53:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-10-24 00:53:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2020-10-24 00:53:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-10-24 00:53:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 435 transitions. [2020-10-24 00:53:30,780 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 435 transitions. Word has length 203 [2020-10-24 00:53:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:30,781 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 435 transitions. [2020-10-24 00:53:30,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:53:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 435 transitions. [2020-10-24 00:53:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-10-24 00:53:30,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:30,786 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:30,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:53:30,787 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1735863863, now seen corresponding path program 3 times [2020-10-24 00:53:30,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:30,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040143144] [2020-10-24 00:53:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:30,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:30,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:30,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:30,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:30,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2020-10-24 00:53:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-10-24 00:53:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 121 proven. 299 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2020-10-24 00:53:31,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040143144] [2020-10-24 00:53:31,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:31,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:53:31,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338165562] [2020-10-24 00:53:31,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:53:31,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:53:31,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:53:31,306 INFO L87 Difference]: Start difference. First operand 310 states and 435 transitions. Second operand 13 states. [2020-10-24 00:53:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:32,809 INFO L93 Difference]: Finished difference Result 602 states and 898 transitions. [2020-10-24 00:53:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:53:32,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2020-10-24 00:53:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:32,816 INFO L225 Difference]: With dead ends: 602 [2020-10-24 00:53:32,817 INFO L226 Difference]: Without dead ends: 310 [2020-10-24 00:53:32,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:53:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-10-24 00:53:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2020-10-24 00:53:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-24 00:53:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 423 transitions. [2020-10-24 00:53:32,890 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 423 transitions. Word has length 238 [2020-10-24 00:53:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:32,891 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 423 transitions. [2020-10-24 00:53:32,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:53:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 423 transitions. [2020-10-24 00:53:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-24 00:53:32,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:32,896 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:32,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:53:32,897 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:32,897 INFO L82 PathProgramCache]: Analyzing trace with hash -914043270, now seen corresponding path program 4 times [2020-10-24 00:53:32,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:32,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [640040727] [2020-10-24 00:53:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:53:32,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:53:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:53:32,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:53:33,033 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:53:33,033 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:53:33,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 00:53:33,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:53:33 BoogieIcfgContainer [2020-10-24 00:53:33,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:53:33,151 INFO L168 Benchmark]: Toolchain (without parser) took 24088.29 ms. Allocated memory was 153.1 MB in the beginning and 463.5 MB in the end (delta: 310.4 MB). Free memory was 130.2 MB in the beginning and 347.6 MB in the end (delta: -217.4 MB). Peak memory consumption was 93.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:33,152 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 153.1 MB. Free memory was 126.4 MB in the beginning and 126.2 MB in the end (delta: 141.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:53:33,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.02 ms. Allocated memory is still 153.1 MB. Free memory was 129.7 MB in the beginning and 120.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:33,153 INFO L168 Benchmark]: Boogie Preprocessor took 69.52 ms. Allocated memory is still 153.1 MB. Free memory was 120.3 MB in the beginning and 119.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:33,154 INFO L168 Benchmark]: RCFGBuilder took 734.68 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 136.0 MB in the end (delta: -17.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:33,155 INFO L168 Benchmark]: TraceAbstraction took 22959.42 ms. Allocated memory was 153.1 MB in the beginning and 463.5 MB in the end (delta: 310.4 MB). Free memory was 136.0 MB in the beginning and 347.6 MB in the end (delta: -211.6 MB). Peak memory consumption was 98.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:33,158 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.32 ms. Allocated memory is still 153.1 MB. Free memory was 126.4 MB in the beginning and 126.2 MB in the end (delta: 141.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 307.02 ms. Allocated memory is still 153.1 MB. Free memory was 129.7 MB in the beginning and 120.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.52 ms. Allocated memory is still 153.1 MB. Free memory was 120.3 MB in the beginning and 119.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 734.68 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 136.0 MB in the end (delta: -17.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22959.42 ms. Allocated memory was 153.1 MB in the beginning and 463.5 MB in the end (delta: 310.4 MB). Free memory was 136.0 MB in the beginning and 347.6 MB in the end (delta: -211.6 MB). Peak memory consumption was 98.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=3, \result=2, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=4, \result=3, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=5, \result=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=2, \result=1, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=3, \result=2, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=2, \result=1, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); VAL [\old(n)=4, \result=3, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=6, \result=8, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); VAL [fibo1(x)=8, result=8, x=6] [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_6-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.7s, OverallIterations: 17, TraceHistogramMax: 21, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 830 SDtfs, 1497 SDslu, 1707 SDs, 0 SdLazy, 5173 SolverSat, 735 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 166 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2083 NumberOfCodeBlocks, 2083 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1830 ConstructedInterpolants, 0 QuantifiedInterpolants, 545846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 3635/5134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...