/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_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:52:29,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:52:29,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:52:29,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:52:29,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:52:29,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:52:29,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:52:29,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:52:29,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:52:29,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:52:29,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:52:29,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:52:29,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:52:29,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:52:29,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:52:29,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:52:29,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:52:29,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:52:29,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:52:29,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:52:29,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:52:29,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:52:29,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:52:29,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:52:29,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:52:29,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:52:29,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:52:29,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:52:29,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:52:29,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:52:29,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:52:29,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:52:29,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:52:29,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:52:29,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:52:29,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:52:29,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:52:29,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:52:29,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:52:29,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:52:29,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:52:29,418 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:52:29,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:52:29,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:52:29,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:52:29,443 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:52:29,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:52:29,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:52:29,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:52:29,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:52:29,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:52:29,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:52:29,445 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:52:29,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:52:29,448 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:52:29,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:52:29,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:52:29,449 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:52:29,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:52:29,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:52:29,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:52:29,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:52:29,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:52:29,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:52:29,450 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:52:29,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:52:29,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:52:29,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:52:29,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:52:29,948 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:52:29,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-10-24 00:52:30,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1f55e0c/48f445e7bdb242b19f37da089f1fa166/FLAG60ddc6a99 [2020-10-24 00:52:30,742 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:52:30,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2020-10-24 00:52:30,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1f55e0c/48f445e7bdb242b19f37da089f1fa166/FLAG60ddc6a99 [2020-10-24 00:52:31,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1f55e0c/48f445e7bdb242b19f37da089f1fa166 [2020-10-24 00:52:31,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:52:31,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:52:31,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:31,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:52:31,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:52:31,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6e5ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31, skipping insertion in model container [2020-10-24 00:52:31,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:52:31,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:52:31,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:31,342 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:52:31,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:52:31,391 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:52:31,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31 WrapperNode [2020-10-24 00:52:31,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:52:31,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:52:31,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:52:31,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:52:31,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (1/1) ... [2020-10-24 00:52:31,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:52:31,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:52:31,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:52:31,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:52:31,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (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:52:31,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:52:31,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:52:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:52:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-10-24 00:52:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-10-24 00:52:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:52:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:52:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:52:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:52:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:52:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:52:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-10-24 00:52:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-10-24 00:52:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:52:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:52:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:52:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:52:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:52:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:52:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:52:32,185 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:52:32,185 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:52:32,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:32 BoogieIcfgContainer [2020-10-24 00:52:32,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:52:32,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:52:32,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:52:32,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:52:32,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:52:31" (1/3) ... [2020-10-24 00:52:32,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f2c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:32, skipping insertion in model container [2020-10-24 00:52:32,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:52:31" (2/3) ... [2020-10-24 00:52:32,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f2c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:52:32, skipping insertion in model container [2020-10-24 00:52:32,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:52:32" (3/3) ... [2020-10-24 00:52:32,204 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2020-10-24 00:52:32,218 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:52:32,225 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:52:32,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:52:32,279 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:52:32,279 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:52:32,279 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:52:32,280 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:52:32,280 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:52:32,280 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:52:32,280 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:52:32,281 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:52:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-10-24 00:52:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:52:32,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:32,317 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:52:32,317 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-10-24 00:52:32,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:32,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597785555] [2020-10-24 00:52:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:32,706 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:52:32,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597785555] [2020-10-24 00:52:32,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:32,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:32,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622991923] [2020-10-24 00:52:32,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:32,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:32,735 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-10-24 00:52:33,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:33,211 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2020-10-24 00:52:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:33,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:52:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:33,225 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:52:33,225 INFO L226 Difference]: Without dead ends: 51 [2020-10-24 00:52:33,229 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:52:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-24 00:52:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-24 00:52:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:33,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-10-24 00:52:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:33,294 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:33,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:52:33,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:33,297 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:52:33,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:52:33,298 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-10-24 00:52:33,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:33,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854243764] [2020-10-24 00:52:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,448 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:52:33,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854243764] [2020-10-24 00:52:33,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:52:33,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:52:33,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780424774] [2020-10-24 00:52:33,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:52:33,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:52:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:52:33,453 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-10-24 00:52:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:33,788 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-10-24 00:52:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:33,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:52:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:33,791 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:52:33,791 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:52:33,793 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:52:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:52:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:52:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:52:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-10-24 00:52:33,811 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-10-24 00:52:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:33,812 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-10-24 00:52:33,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:52:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-10-24 00:52:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:52:33,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:33,815 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:52:33,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:52:33,815 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-10-24 00:52:33,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:33,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735497876] [2020-10-24 00:52:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:33,968 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:52:33,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735497876] [2020-10-24 00:52:33,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:33,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:33,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942732685] [2020-10-24 00:52:33,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:33,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:33,972 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-10-24 00:52:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:34,401 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-10-24 00:52:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:34,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:52:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:34,404 INFO L225 Difference]: With dead ends: 92 [2020-10-24 00:52:34,404 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 00:52:34,405 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:52:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 00:52:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-10-24 00:52:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-24 00:52:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-10-24 00:52:34,423 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-10-24 00:52:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:34,424 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-10-24 00:52:34,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-10-24 00:52:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:52:34,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:34,426 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:52:34,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:52:34,427 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-10-24 00:52:34,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:34,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068308518] [2020-10-24 00:52:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:34,617 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:52:34,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068308518] [2020-10-24 00:52:34,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:34,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:34,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023711191] [2020-10-24 00:52:34,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:34,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:34,620 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-10-24 00:52:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:35,324 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-24 00:52:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:35,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 00:52:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:35,331 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:52:35,332 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:52:35,333 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:52:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:52:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-10-24 00:52:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 00:52:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-10-24 00:52:35,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-10-24 00:52:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:35,362 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-24 00:52:35,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-10-24 00:52:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 00:52:35,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:35,366 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:52:35,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:52:35,366 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-10-24 00:52:35,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:35,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063433342] [2020-10-24 00:52:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:52:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-24 00:52:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:35,587 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:52:35,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063433342] [2020-10-24 00:52:35,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:35,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:52:35,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170412639] [2020-10-24 00:52:35,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:52:35,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:52:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:52:35,591 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-10-24 00:52:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:35,978 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-10-24 00:52:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:52:35,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-10-24 00:52:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:35,982 INFO L225 Difference]: With dead ends: 140 [2020-10-24 00:52:35,982 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:52:35,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 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:52:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:52:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-24 00:52:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 00:52:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-10-24 00:52:36,023 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-10-24 00:52:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:36,023 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-10-24 00:52:36,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:52:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-10-24 00:52:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:52:36,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:36,036 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:52:36,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:52:36,037 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-10-24 00:52:36,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:36,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922949885] [2020-10-24 00:52:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,274 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:52:36,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922949885] [2020-10-24 00:52:36,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:36,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:52:36,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663404998] [2020-10-24 00:52:36,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:52:36,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:36,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:52:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:52:36,278 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-10-24 00:52:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:36,808 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-10-24 00:52:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:52:36,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:52:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:36,812 INFO L225 Difference]: With dead ends: 152 [2020-10-24 00:52:36,812 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:52:36,814 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:52:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:52:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-10-24 00:52:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 00:52:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-10-24 00:52:36,840 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-10-24 00:52:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:36,841 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-10-24 00:52:36,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:52:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-10-24 00:52:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:52:36,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:36,844 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:52:36,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:52:36,845 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-10-24 00:52:36,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:36,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064660638] [2020-10-24 00:52:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:36,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,045 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:52:37,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064660638] [2020-10-24 00:52:37,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:37,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:37,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281374487] [2020-10-24 00:52:37,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:37,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:37,051 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-10-24 00:52:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:37,783 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-10-24 00:52:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:52:37,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 00:52:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:37,787 INFO L225 Difference]: With dead ends: 128 [2020-10-24 00:52:37,787 INFO L226 Difference]: Without dead ends: 121 [2020-10-24 00:52:37,788 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:52:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-24 00:52:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-10-24 00:52:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-24 00:52:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-10-24 00:52:37,824 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-10-24 00:52:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:37,824 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-10-24 00:52:37,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-10-24 00:52:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:52:37,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:37,827 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:52:37,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:52:37,828 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-10-24 00:52:37,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:37,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520043479] [2020-10-24 00:52:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:37,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 00:52:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,018 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:52:38,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520043479] [2020-10-24 00:52:38,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:38,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:52:38,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841568566] [2020-10-24 00:52:38,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:52:38,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:52:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:52:38,022 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-10-24 00:52:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:38,646 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-10-24 00:52:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:38,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-10-24 00:52:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:38,652 INFO L225 Difference]: With dead ends: 237 [2020-10-24 00:52:38,653 INFO L226 Difference]: Without dead ends: 136 [2020-10-24 00:52:38,657 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:52:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-24 00:52:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-10-24 00:52:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 00:52:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-10-24 00:52:38,726 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-10-24 00:52:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:38,726 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-10-24 00:52:38,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:52:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-10-24 00:52:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:52:38,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:38,732 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:52:38,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:52:38,732 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-10-24 00:52:38,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:38,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592599565] [2020-10-24 00:52:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:38,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,014 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:52:39,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592599565] [2020-10-24 00:52:39,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:39,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:39,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060390681] [2020-10-24 00:52:39,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:39,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:39,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:39,025 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 10 states. [2020-10-24 00:52:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:39,820 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-10-24 00:52:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:52:39,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-24 00:52:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:39,824 INFO L225 Difference]: With dead ends: 267 [2020-10-24 00:52:39,824 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 00:52:39,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 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:52:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 00:52:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-10-24 00:52:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-24 00:52:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-10-24 00:52:39,861 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-10-24 00:52:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:39,862 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-10-24 00:52:39,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-10-24 00:52:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:52:39,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:39,865 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:52:39,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:52:39,866 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-10-24 00:52:39,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:39,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1117673423] [2020-10-24 00:52:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:39,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:40,148 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:52:40,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1117673423] [2020-10-24 00:52:40,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:40,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:52:40,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878086856] [2020-10-24 00:52:40,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:52:40,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:40,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:52:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:52:40,153 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 10 states. [2020-10-24 00:52:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:41,095 INFO L93 Difference]: Finished difference Result 223 states and 325 transitions. [2020-10-24 00:52:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:52:41,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2020-10-24 00:52:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:41,101 INFO L225 Difference]: With dead ends: 223 [2020-10-24 00:52:41,101 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 00:52:41,103 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:52:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 00:52:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2020-10-24 00:52:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-24 00:52:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 311 transitions. [2020-10-24 00:52:41,157 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 311 transitions. Word has length 97 [2020-10-24 00:52:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:41,157 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 311 transitions. [2020-10-24 00:52:41,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:52:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 311 transitions. [2020-10-24 00:52:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-24 00:52:41,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:41,162 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:52:41,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:52:41,163 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1242891877, now seen corresponding path program 2 times [2020-10-24 00:52:41,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:41,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884917407] [2020-10-24 00:52:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:52:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:52:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:52:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:52:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-24 00:52:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:52:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:52:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:52:41,418 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:52:41,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884917407] [2020-10-24 00:52:41,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:52:41,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:52:41,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976450167] [2020-10-24 00:52:41,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:52:41,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:52:41,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:52:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:52:41,421 INFO L87 Difference]: Start difference. First operand 210 states and 311 transitions. Second operand 11 states. [2020-10-24 00:52:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:52:42,377 INFO L93 Difference]: Finished difference Result 459 states and 784 transitions. [2020-10-24 00:52:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:52:42,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 115 [2020-10-24 00:52:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:52:42,384 INFO L225 Difference]: With dead ends: 459 [2020-10-24 00:52:42,384 INFO L226 Difference]: Without dead ends: 266 [2020-10-24 00:52:42,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-10-24 00:52:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-10-24 00:52:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2020-10-24 00:52:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-10-24 00:52:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2020-10-24 00:52:42,460 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 115 [2020-10-24 00:52:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:52:42,461 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2020-10-24 00:52:42,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:52:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2020-10-24 00:52:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:52:42,466 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:52:42,466 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:52:42,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:52:42,467 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:52:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:52:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -139933889, now seen corresponding path program 1 times [2020-10-24 00:52:42,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:52:42,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120436657] [2020-10-24 00:52:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:52:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:52:42,501 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:52:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:52:42,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:52:42,629 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:52:42,630 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:52:42,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:52:42,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:52:42 BoogieIcfgContainer [2020-10-24 00:52:42,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:52:42,762 INFO L168 Benchmark]: Toolchain (without parser) took 11676.00 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 128.4 MB in the beginning and 230.7 MB in the end (delta: -102.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:42,762 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory is still 96.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:52:42,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.66 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 117.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:42,769 INFO L168 Benchmark]: Boogie Preprocessor took 66.85 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:42,770 INFO L168 Benchmark]: RCFGBuilder took 728.43 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 128.1 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:42,773 INFO L168 Benchmark]: TraceAbstraction took 10564.92 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 127.8 MB in the beginning and 230.7 MB in the end (delta: -102.9 MB). Peak memory consumption was 9.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:52:42,775 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.21 ms. Allocated memory is still 125.8 MB. Free memory is still 96.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 297.66 ms. Allocated memory is still 151.0 MB. Free memory was 127.7 MB in the beginning and 117.9 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.85 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 728.43 ms. Allocated memory is still 151.0 MB. Free memory was 116.5 MB in the beginning and 128.1 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10564.92 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 127.8 MB in the beginning and 230.7 MB in the end (delta: -102.9 MB). Peak memory consumption was 9.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 = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); VAL [\old(n)=5, \result=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L39] int result = fibo1(x); VAL [fibo1(x)=5, result=5, x=5] [L40] COND TRUE result == 5 VAL [result=5, x=5] [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_5-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: 10.3s, OverallIterations: 12, TraceHistogramMax: 8, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 560 SDtfs, 804 SDslu, 919 SDs, 0 SdLazy, 2508 SolverSat, 334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 84 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 101434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 281/416 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...