/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_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:04:09,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:04:09,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:04:09,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:04:09,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:04:09,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:04:09,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:04:09,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:04:09,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:04:09,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:04:09,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:04:09,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:04:09,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:04:09,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:04:09,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:04:09,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:04:09,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:04:09,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:04:09,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:04:09,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:04:09,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:04:09,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:04:09,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:04:09,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:04:09,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:04:09,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:04:09,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:04:09,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:04:09,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:04:09,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:04:09,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:04:09,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:04:09,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:04:09,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:04:09,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:04:09,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:04:09,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:04:09,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:04:09,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:04:09,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:04:09,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:04:09,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:04:09,457 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:04:09,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:04:09,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:04:09,463 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:04:09,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:04:09,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:04:09,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:04:09,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:04:09,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:04:09,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:04:09,466 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:04:09,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:04:09,466 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:04:09,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:04:09,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:04:09,467 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:04:09,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:04:09,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:04:09,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:09,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:04:09,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:04:09,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:04:09,468 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:04:09,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:04:09,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:04:09,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:04:09,931 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:04:09,932 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:04:09,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-11-07 05:04:10,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4041f51/fd453ce830064542987a8585867eabba/FLAG8e93a7a72 [2020-11-07 05:04:10,776 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:04:10,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-11-07 05:04:10,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4041f51/fd453ce830064542987a8585867eabba/FLAG8e93a7a72 [2020-11-07 05:04:11,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4041f51/fd453ce830064542987a8585867eabba [2020-11-07 05:04:11,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:04:11,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:04:11,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:11,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:04:11,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:04:11,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213e5090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11, skipping insertion in model container [2020-11-07 05:04:11,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:04:11,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:04:11,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:11,417 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:04:11,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:04:11,456 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:04:11,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11 WrapperNode [2020-11-07 05:04:11,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:04:11,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:04:11,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:04:11,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:04:11,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2020-11-07 05:04:11,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:04:11,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:04:11,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:04:11,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:04:11,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:04:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:04:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:04:11,583 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:04:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-07 05:04:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-07 05:04:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:04:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-07 05:04:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-07 05:04:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:04:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:04:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:04:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:04:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:04:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:04:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:04:11,925 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:04:11,925 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:04:11,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:11 BoogieIcfgContainer [2020-11-07 05:04:11,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:04:11,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:04:11,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:04:11,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:04:11,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:11" (1/3) ... [2020-11-07 05:04:11,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24719c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:11, skipping insertion in model container [2020-11-07 05:04:11,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (2/3) ... [2020-11-07 05:04:11,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24719c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:11, skipping insertion in model container [2020-11-07 05:04:11,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:11" (3/3) ... [2020-11-07 05:04:11,943 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-11-07 05:04:11,970 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:04:11,981 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:04:12,025 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:04:12,097 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:04:12,101 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:04:12,102 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:04:12,102 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:04:12,102 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:04:12,102 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:04:12,102 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:04:12,103 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:04:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-11-07 05:04:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:04:12,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:12,163 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-11-07 05:04:12,163 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash 775886402, now seen corresponding path program 1 times [2020-11-07 05:04:12,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:12,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886428613] [2020-11-07 05:04:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:12,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:12,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:12,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886428613] [2020-11-07 05:04:12,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:12,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:12,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362580330] [2020-11-07 05:04:12,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:12,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:12,646 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 6 states. [2020-11-07 05:04:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:13,083 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2020-11-07 05:04:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:04:13,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:04:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:13,110 INFO L225 Difference]: With dead ends: 71 [2020-11-07 05:04:13,110 INFO L226 Difference]: Without dead ends: 51 [2020-11-07 05:04:13,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-07 05:04:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-11-07 05:04:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:13,182 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 25 [2020-11-07 05:04:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:13,182 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:13,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:04:13,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:13,186 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-11-07 05:04:13,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:04:13,186 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 478831265, now seen corresponding path program 1 times [2020-11-07 05:04:13,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:13,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [526615891] [2020-11-07 05:04:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:04:13,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [526615891] [2020-11-07 05:04:13,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:04:13,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:04:13,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206226350] [2020-11-07 05:04:13,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:04:13,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:04:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:04:13,314 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2020-11-07 05:04:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:13,605 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-11-07 05:04:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:04:13,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:04:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:13,608 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:04:13,609 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:04:13,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:04:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:04:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:04:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2020-11-07 05:04:13,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 26 [2020-11-07 05:04:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:13,630 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2020-11-07 05:04:13,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:04:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2020-11-07 05:04:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:04:13,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:13,633 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-11-07 05:04:13,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:04:13,633 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash -708858972, now seen corresponding path program 1 times [2020-11-07 05:04:13,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:13,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740618988] [2020-11-07 05:04:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:13,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740618988] [2020-11-07 05:04:13,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:13,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:13,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979633402] [2020-11-07 05:04:13,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:13,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:13,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:13,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:13,815 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 7 states. [2020-11-07 05:04:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:14,189 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2020-11-07 05:04:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:14,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:04:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:14,191 INFO L225 Difference]: With dead ends: 92 [2020-11-07 05:04:14,192 INFO L226 Difference]: Without dead ends: 55 [2020-11-07 05:04:14,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-07 05:04:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2020-11-07 05:04:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-07 05:04:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-11-07 05:04:14,210 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 42 [2020-11-07 05:04:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:14,210 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-11-07 05:04:14,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-11-07 05:04:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:04:14,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:14,213 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-11-07 05:04:14,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:04:14,213 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1629720462, now seen corresponding path program 1 times [2020-11-07 05:04:14,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:14,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165934907] [2020-11-07 05:04:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:14,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:14,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:14,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:14,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:04:14,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1165934907] [2020-11-07 05:04:14,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:14,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:14,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014335720] [2020-11-07 05:04:14,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:14,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:14,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:14,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:14,443 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2020-11-07 05:04:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:15,091 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-11-07 05:04:15,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:15,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-11-07 05:04:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:15,095 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:04:15,095 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:04:15,098 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-11-07 05:04:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:04:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2020-11-07 05:04:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:04:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2020-11-07 05:04:15,136 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 43 [2020-11-07 05:04:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:15,137 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-11-07 05:04:15,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2020-11-07 05:04:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:04:15,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:15,146 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-11-07 05:04:15,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:04:15,146 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1688308117, now seen corresponding path program 1 times [2020-11-07 05:04:15,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:15,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798653883] [2020-11-07 05:04:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:04:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:04:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:15,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798653883] [2020-11-07 05:04:15,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:15,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:04:15,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424732489] [2020-11-07 05:04:15,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:04:15,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:04:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:04:15,336 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 7 states. [2020-11-07 05:04:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:15,856 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2020-11-07 05:04:15,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:04:15,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-11-07 05:04:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:15,866 INFO L225 Difference]: With dead ends: 140 [2020-11-07 05:04:15,867 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:04:15,869 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-11-07 05:04:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:04:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 05:04:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 05:04:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2020-11-07 05:04:15,918 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 59 [2020-11-07 05:04:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:15,919 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2020-11-07 05:04:15,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:04:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2020-11-07 05:04:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:04:15,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:15,930 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-11-07 05:04:15,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:04:15,930 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:15,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash -439427312, now seen corresponding path program 1 times [2020-11-07 05:04:15,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:15,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104295376] [2020-11-07 05:04:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:15,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:04:16,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104295376] [2020-11-07 05:04:16,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:16,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:16,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594676854] [2020-11-07 05:04:16,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:16,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:16,140 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand 8 states. [2020-11-07 05:04:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:16,784 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2020-11-07 05:04:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:04:16,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:04:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:16,789 INFO L225 Difference]: With dead ends: 152 [2020-11-07 05:04:16,790 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:04:16,791 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-11-07 05:04:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:04:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2020-11-07 05:04:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 05:04:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2020-11-07 05:04:16,817 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 60 [2020-11-07 05:04:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:16,817 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2020-11-07 05:04:16,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2020-11-07 05:04:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:04:16,820 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:16,820 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-11-07 05:04:16,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:04:16,820 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1841264646, now seen corresponding path program 1 times [2020-11-07 05:04:16,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:16,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684764597] [2020-11-07 05:04:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:16,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:17,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:17,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 05:04:17,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684764597] [2020-11-07 05:04:17,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:17,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:17,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683042891] [2020-11-07 05:04:17,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:17,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:17,019 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 9 states. [2020-11-07 05:04:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:17,853 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2020-11-07 05:04:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:04:17,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 05:04:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:17,857 INFO L225 Difference]: With dead ends: 128 [2020-11-07 05:04:17,858 INFO L226 Difference]: Without dead ends: 121 [2020-11-07 05:04:17,859 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-11-07 05:04:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-07 05:04:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2020-11-07 05:04:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:04:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2020-11-07 05:04:17,907 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 61 [2020-11-07 05:04:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:17,913 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2020-11-07 05:04:17,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2020-11-07 05:04:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 05:04:17,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:17,918 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-11-07 05:04:17,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:04:17,918 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 942662771, now seen corresponding path program 1 times [2020-11-07 05:04:17,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:17,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561248521] [2020-11-07 05:04:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:04:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:04:18,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561248521] [2020-11-07 05:04:18,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:18,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:04:18,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250839051] [2020-11-07 05:04:18,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:04:18,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:04:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:04:18,160 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 9 states. [2020-11-07 05:04:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:18,880 INFO L93 Difference]: Finished difference Result 237 states and 358 transitions. [2020-11-07 05:04:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:18,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2020-11-07 05:04:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:18,886 INFO L225 Difference]: With dead ends: 237 [2020-11-07 05:04:18,886 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 05:04:18,888 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-11-07 05:04:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 05:04:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2020-11-07 05:04:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 05:04:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2020-11-07 05:04:18,931 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 78 [2020-11-07 05:04:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:18,932 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2020-11-07 05:04:18,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:04:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2020-11-07 05:04:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:04:18,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:18,934 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-11-07 05:04:18,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:04:18,935 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1118264142, now seen corresponding path program 1 times [2020-11-07 05:04:18,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:18,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718232864] [2020-11-07 05:04:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:18,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 05:04:19,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718232864] [2020-11-07 05:04:19,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:19,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:04:19,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292836529] [2020-11-07 05:04:19,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:04:19,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:04:19,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:19,226 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand 11 states. [2020-11-07 05:04:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:20,136 INFO L93 Difference]: Finished difference Result 267 states and 410 transitions. [2020-11-07 05:04:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:04:20,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2020-11-07 05:04:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:20,141 INFO L225 Difference]: With dead ends: 267 [2020-11-07 05:04:20,142 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 05:04:20,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:04:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 05:04:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2020-11-07 05:04:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:04:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-11-07 05:04:20,188 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 79 [2020-11-07 05:04:20,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:20,188 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-11-07 05:04:20,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:04:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-11-07 05:04:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:04:20,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:20,192 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-11-07 05:04:20,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:04:20,192 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:20,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash 546182201, now seen corresponding path program 2 times [2020-11-07 05:04:20,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:20,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093284639] [2020-11-07 05:04:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 43 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-07 05:04:20,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093284639] [2020-11-07 05:04:20,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:20,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:04:20,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548443540] [2020-11-07 05:04:20,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:04:20,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:04:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:20,632 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 13 states. [2020-11-07 05:04:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:22,207 INFO L93 Difference]: Finished difference Result 278 states and 422 transitions. [2020-11-07 05:04:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:04:22,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-11-07 05:04:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:22,212 INFO L225 Difference]: With dead ends: 278 [2020-11-07 05:04:22,213 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 05:04:22,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:04:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 05:04:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2020-11-07 05:04:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:04:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2020-11-07 05:04:22,251 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 97 [2020-11-07 05:04:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:22,251 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2020-11-07 05:04:22,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:04:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2020-11-07 05:04:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 05:04:22,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:22,254 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 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, 1, 1] [2020-11-07 05:04:22,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:04:22,255 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash 693727952, now seen corresponding path program 1 times [2020-11-07 05:04:22,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:22,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [871712659] [2020-11-07 05:04:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2020-11-07 05:04:22,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [871712659] [2020-11-07 05:04:22,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:22,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:04:22,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437733117] [2020-11-07 05:04:22,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:04:22,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:04:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:04:22,792 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 18 states. [2020-11-07 05:04:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:25,258 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2020-11-07 05:04:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 05:04:25,259 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2020-11-07 05:04:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:25,262 INFO L225 Difference]: With dead ends: 185 [2020-11-07 05:04:25,262 INFO L226 Difference]: Without dead ends: 178 [2020-11-07 05:04:25,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 05:04:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-11-07 05:04:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2020-11-07 05:04:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-07 05:04:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2020-11-07 05:04:25,303 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 96 [2020-11-07 05:04:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:25,303 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2020-11-07 05:04:25,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:04:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2020-11-07 05:04:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:04:25,306 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:25,306 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 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] [2020-11-07 05:04:25,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:04:25,306 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:25,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1477616796, now seen corresponding path program 2 times [2020-11-07 05:04:25,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:25,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696375569] [2020-11-07 05:04:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:04:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-07 05:04:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-11-07 05:04:25,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696375569] [2020-11-07 05:04:25,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:25,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:04:25,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840310597] [2020-11-07 05:04:25,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:04:25,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:04:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:04:25,513 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand 8 states. [2020-11-07 05:04:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:26,110 INFO L93 Difference]: Finished difference Result 274 states and 371 transitions. [2020-11-07 05:04:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:04:26,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-11-07 05:04:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:26,115 INFO L225 Difference]: With dead ends: 274 [2020-11-07 05:04:26,115 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 05:04:26,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:04:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 05:04:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-07 05:04:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-07 05:04:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-11-07 05:04:26,169 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 97 [2020-11-07 05:04:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:26,170 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-11-07 05:04:26,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:04:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-11-07 05:04:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 05:04:26,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:26,172 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 05:04:26,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:04:26,173 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -443839068, now seen corresponding path program 3 times [2020-11-07 05:04:26,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:26,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821538287] [2020-11-07 05:04:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-07 05:04:26,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821538287] [2020-11-07 05:04:26,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:26,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:04:26,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909525206] [2020-11-07 05:04:26,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:04:26,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:26,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:04:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:04:26,492 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 13 states. [2020-11-07 05:04:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:28,072 INFO L93 Difference]: Finished difference Result 278 states and 366 transitions. [2020-11-07 05:04:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:04:28,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2020-11-07 05:04:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:28,075 INFO L225 Difference]: With dead ends: 278 [2020-11-07 05:04:28,076 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:04:28,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:04:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:04:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2020-11-07 05:04:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 05:04:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2020-11-07 05:04:28,106 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 114 [2020-11-07 05:04:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:28,106 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2020-11-07 05:04:28,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:04:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2020-11-07 05:04:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 05:04:28,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:28,109 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 05:04:28,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:04:28,109 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1084912860, now seen corresponding path program 3 times [2020-11-07 05:04:28,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:28,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022825534] [2020-11-07 05:04:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 05:04:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 45 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-11-07 05:04:28,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022825534] [2020-11-07 05:04:28,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:28,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:04:28,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515609707] [2020-11-07 05:04:28,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:04:28,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:04:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:28,388 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 11 states. [2020-11-07 05:04:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:29,183 INFO L93 Difference]: Finished difference Result 208 states and 263 transitions. [2020-11-07 05:04:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:04:29,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2020-11-07 05:04:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:29,185 INFO L225 Difference]: With dead ends: 208 [2020-11-07 05:04:29,185 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 05:04:29,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:04:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 05:04:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-07 05:04:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 05:04:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2020-11-07 05:04:29,209 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 114 [2020-11-07 05:04:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:29,210 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2020-11-07 05:04:29,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:04:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2020-11-07 05:04:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-07 05:04:29,213 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:29,213 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:04:29,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:04:29,214 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -360460350, now seen corresponding path program 4 times [2020-11-07 05:04:29,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:29,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555362147] [2020-11-07 05:04:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-07 05:04:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 70 proven. 295 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2020-11-07 05:04:29,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555362147] [2020-11-07 05:04:29,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:29,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:04:29,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656624073] [2020-11-07 05:04:29,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:04:29,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:29,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:04:29,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:04:29,711 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand 14 states. [2020-11-07 05:04:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:31,340 INFO L93 Difference]: Finished difference Result 225 states and 296 transitions. [2020-11-07 05:04:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:04:31,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 220 [2020-11-07 05:04:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:31,343 INFO L225 Difference]: With dead ends: 225 [2020-11-07 05:04:31,343 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:04:31,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2020-11-07 05:04:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:04:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-11-07 05:04:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 05:04:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2020-11-07 05:04:31,371 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 220 [2020-11-07 05:04:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:31,372 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2020-11-07 05:04:31,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:04:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2020-11-07 05:04:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-07 05:04:31,374 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:04:31,374 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 05:04:31,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:04:31,374 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:04:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:04:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1978690859, now seen corresponding path program 2 times [2020-11-07 05:04:31,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:04:31,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196782685] [2020-11-07 05:04:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:04:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:04:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:04:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:04:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:04:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:04:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:04:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:04:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:04:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 43 proven. 69 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2020-11-07 05:04:31,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196782685] [2020-11-07 05:04:31,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:04:31,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:04:31,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244890806] [2020-11-07 05:04:31,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:04:31,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:04:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:04:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:04:31,659 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 11 states. [2020-11-07 05:04:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:04:32,504 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2020-11-07 05:04:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:04:32,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2020-11-07 05:04:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:04:32,506 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:04:32,506 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:04:32,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:04:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:04:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:04:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:04:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:04:32,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2020-11-07 05:04:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:04:32,508 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:04:32,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:04:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:04:32,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:04:32,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:04:32,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:04:33,287 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2020-11-07 05:04:33,924 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2020-11-07 05:04:34,414 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2020-11-07 05:04:34,758 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2020-11-07 05:04:36,294 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2020-11-07 05:04:38,851 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 8 [2020-11-07 05:04:39,054 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 6 [2020-11-07 05:04:39,222 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 7 [2020-11-07 05:04:39,562 WARN L194 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 24 [2020-11-07 05:04:40,095 WARN L194 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 34 [2020-11-07 05:04:40,224 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 6 [2020-11-07 05:04:40,824 WARN L194 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 27 [2020-11-07 05:04:41,152 WARN L194 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 24 [2020-11-07 05:04:41,542 WARN L194 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 28 [2020-11-07 05:04:41,949 WARN L194 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 28 [2020-11-07 05:04:42,069 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 6 [2020-11-07 05:04:42,443 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2020-11-07 05:04:42,804 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2020-11-07 05:04:43,437 WARN L194 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2020-11-07 05:04:43,744 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2020-11-07 05:04:43,885 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 6 [2020-11-07 05:04:44,701 WARN L194 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 33 [2020-11-07 05:04:44,914 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 6 [2020-11-07 05:04:45,247 WARN L194 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2020-11-07 05:04:45,886 WARN L194 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 31 [2020-11-07 05:04:46,268 WARN L194 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2020-11-07 05:04:46,573 WARN L194 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 22 [2020-11-07 05:04:46,751 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 8 [2020-11-07 05:04:47,650 WARN L194 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 33 [2020-11-07 05:04:47,823 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,823 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,823 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,823 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,823 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,824 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,824 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,824 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,824 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,824 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 37 44) the Hoare annotation is: true [2020-11-07 05:04:47,825 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 37 44) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: false [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L40(lines 40 42) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: false [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L40-2(lines 40 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-11-07 05:04:47,826 INFO L262 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (<= 3 |main_#t~ret11|)) [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= |main_#t~ret11| 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= 3 |main_#t~ret11|)) [2020-11-07 05:04:47,827 INFO L269 CegarLoopResult]: At program point fibo2ENTRY(lines 19 27) the Hoare annotation is: true [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n)) [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1)) [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (or (and (<= |fibo2_#t~ret9| 1) (<= 1 |fibo2_#t~ret9|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-11-07 05:04:47,827 INFO L262 CegarLoopResult]: At program point L22(lines 22 26) the Hoare annotation is: (and (<= 1 |fibo2_#in~n|) (= fibo2_~n |fibo2_#in~n|)) [2020-11-07 05:04:47,828 INFO L262 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse3 (<= 1 |fibo2_#t~ret9|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 2 .cse0) (<= 3 fibo2_~n) .cse1 .cse2 (<= .cse0 2) .cse3) (and .cse1 (<= fibo2_~n 2) (<= .cse0 1) (< 1 fibo2_~n) .cse3 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) .cse2))) (not (<= |fibo2_#in~n| 1))) [2020-11-07 05:04:47,828 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-11-07 05:04:47,828 INFO L262 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (and (let ((.cse1 (<= |fibo2_#t~ret9| 1)) (.cse3 (<= 1 |fibo2_#t~ret9|)) (.cse0 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 2 .cse0) (<= 3 fibo2_~n) .cse1 .cse2 (<= .cse0 2) .cse3) (and .cse1 (<= fibo2_~n 2) (<= .cse0 1) (< 1 fibo2_~n) .cse3 (<= 1 .cse0) (<= |fibo2_#in~n| 2)) (and (<= 4 |fibo2_#in~n|) .cse2))) (not (<= |fibo2_#in~n| 1))) [2020-11-07 05:04:47,828 INFO L262 CegarLoopResult]: At program point L20(lines 20 26) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-11-07 05:04:47,828 INFO L262 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse4 (<= |fibo2_#t~ret9| 1)) (.cse5 (<= 1 |fibo2_#t~ret9|)) (.cse3 (+ |fibo2_#t~ret9| |fibo2_#t~ret10|))) (let ((.cse2 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse4 (<= fibo2_~n 2) (<= .cse3 1) (< 1 fibo2_~n) .cse5 (<= 1 .cse3) (<= |fibo2_#in~n| 2))) (.cse0 (<= |fibo2_#in~n| 3)) (.cse1 (= fibo2_~n |fibo2_#in~n|))) (and (or (and .cse0 (<= 2 |fibo2_#res|)) (and (<= 4 |fibo2_#in~n|) .cse1) .cse2) (or .cse2 (not .cse0) (and (<= 2 .cse3) (<= |fibo2_#res| 2) (<= 3 fibo2_~n) .cse4 .cse1 (<= .cse3 2) .cse5)) (not (<= |fibo2_#in~n| 1))))) [2020-11-07 05:04:47,829 INFO L262 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) (<= fibo2_~n 2) (< 1 fibo2_~n) .cse1))) (and (or .cse0 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (not (<= |fibo2_#in~n| 3))) (= fibo2_~n |fibo2_#in~n|) (or .cse0 (not .cse1))))) [2020-11-07 05:04:47,829 INFO L262 CegarLoopResult]: At program point fibo2FINAL(lines 19 27) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo2_#in~n|)) (.cse6 (<= 1 |fibo2_#res|)) (.cse7 (<= |fibo2_#res| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse6 .cse7 .cse2 (< 1 fibo2_~n) .cse4)) (.cse1 (and .cse5 .cse6 .cse7 .cse2 (<= |fibo2_#in~n| 1))) (.cse3 (<= |fibo2_#in~n| 0))) (and (or .cse0 .cse1 (and .cse2 .cse3) (not .cse4)) (or .cse0 .cse1 (and (<= 4 |fibo2_#in~n|) .cse2) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse2) .cse3) (or .cse5 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))))) [2020-11-07 05:04:47,829 INFO L262 CegarLoopResult]: At program point fibo2EXIT(lines 19 27) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo2_#in~n|)) (.cse6 (<= 1 |fibo2_#res|)) (.cse7 (<= |fibo2_#res| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= |fibo2_#in~n| 2))) (let ((.cse0 (and .cse6 .cse7 .cse2 (< 1 fibo2_~n) .cse4)) (.cse1 (and .cse5 .cse6 .cse7 .cse2 (<= |fibo2_#in~n| 1))) (.cse3 (<= |fibo2_#in~n| 0))) (and (or .cse0 .cse1 (and .cse2 .cse3) (not .cse4)) (or .cse0 .cse1 (and (<= 4 |fibo2_#in~n|) .cse2) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse2) .cse3) (or .cse5 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))))) [2020-11-07 05:04:47,829 INFO L269 CegarLoopResult]: At program point fibo1ENTRY(lines 9 17) the Hoare annotation is: true [2020-11-07 05:04:47,829 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 .cse1) (and .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1))) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 .cse1) (and .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1))) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L12(lines 12 16) the Hoare annotation is: (and (<= 1 |fibo1_#in~n|) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-11-07 05:04:47,830 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-11-07 05:04:47,831 INFO L262 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and (or (let ((.cse0 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= .cse0 3) (<= 4 fibo1_~n) (<= 3 .cse0) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1))) .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) [2020-11-07 05:04:47,831 INFO L262 CegarLoopResult]: At program point fibo1FINAL(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 05:04:47,831 INFO L262 CegarLoopResult]: At program point L10(lines 10 16) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-11-07 05:04:47,831 INFO L262 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse3 (<= |fibo1_#in~n| 3))) (let ((.cse2 (and .cse3 (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) (< 1 fibo1_~n)))) (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret7| |fibo1_#t~ret8|))) (and (<= |fibo1_#res| 3) (<= .cse1 3) (<= 3 |fibo1_#res|) (<= 3 .cse1) (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|))) .cse2)) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2)) (or (not .cse3) .cse2)))) [2020-11-07 05:04:47,831 INFO L262 CegarLoopResult]: At program point L15-6(line 15) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 3)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (and (or (not .cse0) (and (<= 1 |fibo1_#t~ret7|) (<= |fibo1_#t~ret7| 1) .cse1)) (or .cse0 (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse1 (<= |fibo1_#t~ret7| 2) (<= 2 |fibo1_#t~ret7|)) (and (<= 5 |fibo1_#in~n|) .cse1)) (not (<= |fibo1_#in~n| 2)))) [2020-11-07 05:04:47,832 INFO L262 CegarLoopResult]: At program point fibo1EXIT(lines 9 17) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) (<= 3 fibo1_~n) .cse0) (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0) (and (<= |fibo1_#in~n| 1) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (or (<= |fibo1_#in~n| 0) (and (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (not (<= |fibo1_#in~n| 2))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-11-07 05:04:47,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:04:47 BoogieIcfgContainer [2020-11-07 05:04:47,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:04:47,876 INFO L168 Benchmark]: Toolchain (without parser) took 36716.94 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 132.3 MB in the beginning and 181.2 MB in the end (delta: -48.9 MB). Peak memory consumption was 233.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:47,877 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory is still 129.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:04:47,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.88 ms. Allocated memory is still 155.2 MB. Free memory was 131.7 MB in the beginning and 122.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:47,881 INFO L168 Benchmark]: Boogie Preprocessor took 43.84 ms. Allocated memory is still 155.2 MB. Free memory was 122.2 MB in the beginning and 120.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:47,882 INFO L168 Benchmark]: RCFGBuilder took 425.03 ms. Allocated memory is still 155.2 MB. Free memory was 120.7 MB in the beginning and 136.9 MB in the end (delta: -16.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:47,882 INFO L168 Benchmark]: TraceAbstraction took 35938.69 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 136.4 MB in the beginning and 181.2 MB in the end (delta: -44.9 MB). Peak memory consumption was 236.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:04:47,887 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.28 ms. Allocated memory is still 155.2 MB. Free memory is still 129.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 293.88 ms. Allocated memory is still 155.2 MB. Free memory was 131.7 MB in the beginning and 122.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.84 ms. Allocated memory is still 155.2 MB. Free memory was 122.2 MB in the beginning and 120.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 425.03 ms. Allocated memory is still 155.2 MB. Free memory was 120.7 MB in the beginning and 136.9 MB in the end (delta: -16.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35938.69 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 136.4 MB in the beginning and 181.2 MB in the end (delta: -44.9 MB). Peak memory consumption was 236.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 37]: Procedure Contract for main Derived contract for procedure main: 4 <= x - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((((((1 <= \result && \result <= 1) && n == \old(n)) && 1 < n) && \old(n) <= 2) || ((((1 <= \old(n) && 1 <= \result) && \result <= 1) && n == \old(n)) && \old(n) <= 1)) || (n == \old(n) && \old(n) <= 0)) || !(\old(n) <= 2)) && ((((((((1 <= \result && \result <= 1) && n == \old(n)) && 1 < n) && \old(n) <= 2) || ((((1 <= \old(n) && 1 <= \result) && \result <= 1) && n == \old(n)) && \old(n) <= 1)) || (4 <= \old(n) && n == \old(n))) || ((\result <= 2 && 2 <= \result) && n == \old(n))) || \old(n) <= 0)) && (1 <= \old(n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((((\old(n) <= 3 && 3 <= n) && n == \old(n)) || ((\result <= 3 && 3 <= \result) && n == \old(n))) || (\old(n) <= 1 && n == \old(n))) || (5 <= \old(n) && n == \old(n))) && ((\old(n) <= 0 || (\result <= 1 && 1 <= \result)) || !(\old(n) <= 2))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.4s, OverallIterations: 16, TraceHistogramMax: 13, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 818 SDtfs, 1382 SDslu, 1776 SDs, 0 SdLazy, 5161 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred 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.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 115 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 2203 PreInvPairs, 3925 NumberOfFragments, 1165 HoareAnnotationTreeSize, 2203 FomulaSimplifications, 379480 FormulaSimplificationTreeSizeReduction, 6.1s HoareSimplificationTime, 57 FomulaSimplificationsInter, 57321 FormulaSimplificationTreeSizeReductionInter, 9.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 301516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 1117/1711 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...