/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.1 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 03:32:23,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 03:32:23,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 03:32:23,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 03:32:23,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 03:32:23,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 03:32:23,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 03:32:23,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 03:32:23,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 03:32:23,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 03:32:23,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 03:32:23,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 03:32:23,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 03:32:23,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 03:32:23,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 03:32:23,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 03:32:23,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 03:32:23,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 03:32:23,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 03:32:23,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 03:32:23,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 03:32:23,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 03:32:23,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 03:32:23,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 03:32:23,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 03:32:23,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 03:32:23,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 03:32:23,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 03:32:23,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 03:32:23,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 03:32:23,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 03:32:23,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 03:32:23,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 03:32:23,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 03:32:23,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 03:32:23,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 03:32:23,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 03:32:23,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 03:32:23,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 03:32:23,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 03:32:23,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 03:32:23,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 03:32:23,478 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 03:32:23,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 03:32:23,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 03:32:23,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 03:32:23,480 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 03:32:23,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 03:32:23,480 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 03:32:23,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 03:32:23,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 03:32:23,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 03:32:23,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 03:32:23,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 03:32:23,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 03:32:23,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 03:32:23,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 03:32:23,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 03:32:23,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 03:32:23,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 03:32:23,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 03:32:23,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 03:32:23,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 03:32:23,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 03:32:23,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 03:32:23,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 03:32:23,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 03:32:23,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 03:32:23,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 03:32:23,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 03:32:23,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 03:32:23,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.1; [2020-08-19 03:32:23,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 03:32:23,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 03:32:23,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 03:32:23,831 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 03:32:23,831 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 03:32:23,832 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 03:32:23,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1a5b0777e/a2adcc60f7e34ee9905f84f4ea082a7c/FLAG450c7dd90 [2020-08-19 03:32:24,338 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 03:32:24,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 03:32:24,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1a5b0777e/a2adcc60f7e34ee9905f84f4ea082a7c/FLAG450c7dd90 [2020-08-19 03:32:24,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1a5b0777e/a2adcc60f7e34ee9905f84f4ea082a7c [2020-08-19 03:32:24,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 03:32:24,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 03:32:24,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 03:32:24,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 03:32:24,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 03:32:24,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284e4e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24, skipping insertion in model container [2020-08-19 03:32:24,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 03:32:24,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 03:32:24,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:32:24,912 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 03:32:24,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 03:32:24,942 INFO L208 MainTranslator]: Completed translation [2020-08-19 03:32:24,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24 WrapperNode [2020-08-19 03:32:24,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 03:32:24,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 03:32:24,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 03:32:24,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 03:32:24,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... [2020-08-19 03:32:24,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 03:32:24,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 03:32:24,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 03:32:24,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 03:32:24,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-08-19 03:32:25,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 03:32:25,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 03:32:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 03:32:25,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 03:32:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 03:32:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 03:32:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 03:32:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 03:32:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 03:32:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 03:32:25,312 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 03:32:25,313 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 03:32:25,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:32:25 BoogieIcfgContainer [2020-08-19 03:32:25,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 03:32:25,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 03:32:25,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 03:32:25,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 03:32:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 03:32:24" (1/3) ... [2020-08-19 03:32:25,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:32:25, skipping insertion in model container [2020-08-19 03:32:25,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 03:32:24" (2/3) ... [2020-08-19 03:32:25,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 03:32:25, skipping insertion in model container [2020-08-19 03:32:25,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 03:32:25" (3/3) ... [2020-08-19 03:32:25,326 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 03:32:25,335 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 03:32:25,342 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 03:32:25,357 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 03:32:25,381 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 03:32:25,382 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 03:32:25,382 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 03:32:25,382 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 03:32:25,382 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 03:32:25,382 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 03:32:25,383 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 03:32:25,383 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 03:32:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 03:32:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 03:32:25,407 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:25,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:25,408 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:25,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 03:32:25,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:25,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [635986946] [2020-08-19 03:32:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:32:25,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [635986946] [2020-08-19 03:32:25,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:32:25,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 03:32:25,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42194345] [2020-08-19 03:32:25,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 03:32:25,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:25,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 03:32:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 03:32:25,657 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 03:32:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:25,785 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 03:32:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 03:32:25,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 03:32:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:25,799 INFO L225 Difference]: With dead ends: 35 [2020-08-19 03:32:25,799 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 03:32:25,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 03:32:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 03:32:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 03:32:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 03:32:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 03:32:25,852 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 03:32:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:25,853 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 03:32:25,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 03:32:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 03:32:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 03:32:25,856 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:25,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:25,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 03:32:25,857 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 03:32:25,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:25,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856972288] [2020-08-19 03:32:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 03:32:25,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1856972288] [2020-08-19 03:32:25,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 03:32:25,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 03:32:25,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380545699] [2020-08-19 03:32:25,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 03:32:25,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 03:32:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 03:32:25,945 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 03:32:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:26,026 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 03:32:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 03:32:26,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 03:32:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:26,028 INFO L225 Difference]: With dead ends: 27 [2020-08-19 03:32:26,028 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 03:32:26,030 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 03:32:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 03:32:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 03:32:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 03:32:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 03:32:26,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 03:32:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:26,039 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 03:32:26,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 03:32:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 03:32:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 03:32:26,040 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:26,041 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:26,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 03:32:26,041 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 03:32:26,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:26,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394693369] [2020-08-19 03:32:26,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 03:32:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 03:32:26,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394693369] [2020-08-19 03:32:26,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:26,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 03:32:26,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10188014] [2020-08-19 03:32:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 03:32:26,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 03:32:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 03:32:26,174 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 03:32:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:26,295 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 03:32:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 03:32:26,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 03:32:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:26,298 INFO L225 Difference]: With dead ends: 38 [2020-08-19 03:32:26,298 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 03:32:26,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-19 03:32:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 03:32:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 03:32:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 03:32:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 03:32:26,314 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 03:32:26,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:26,315 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 03:32:26,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 03:32:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 03:32:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 03:32:26,317 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:26,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:26,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 03:32:26,318 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 03:32:26,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:26,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1318373876] [2020-08-19 03:32:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 03:32:26,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1318373876] [2020-08-19 03:32:26,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:26,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 03:32:26,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732567388] [2020-08-19 03:32:26,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 03:32:26,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 03:32:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 03:32:26,427 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 03:32:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:26,593 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 03:32:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 03:32:26,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 03:32:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:26,599 INFO L225 Difference]: With dead ends: 41 [2020-08-19 03:32:26,600 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 03:32:26,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 03:32:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 03:32:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 03:32:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 03:32:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 03:32:26,628 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 03:32:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:26,628 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 03:32:26,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 03:32:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 03:32:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 03:32:26,633 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:26,635 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:26,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 03:32:26,635 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 03:32:26,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:26,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544858146] [2020-08-19 03:32:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 03:32:26,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544858146] [2020-08-19 03:32:26,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:26,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 03:32:26,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242142867] [2020-08-19 03:32:26,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:32:26,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:32:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:32:26,821 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 03:32:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:26,937 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 03:32:26,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 03:32:26,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 03:32:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:26,940 INFO L225 Difference]: With dead ends: 76 [2020-08-19 03:32:26,940 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 03:32:26,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-19 03:32:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 03:32:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 03:32:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 03:32:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 03:32:26,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 03:32:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:26,954 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 03:32:26,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:32:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 03:32:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 03:32:26,957 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:26,957 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:26,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 03:32:26,958 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:26,958 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 03:32:26,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:26,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326368577] [2020-08-19 03:32:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 03:32:27,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326368577] [2020-08-19 03:32:27,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:27,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 03:32:27,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425691781] [2020-08-19 03:32:27,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 03:32:27,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:27,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 03:32:27,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 03:32:27,099 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 03:32:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:27,223 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 03:32:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 03:32:27,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 03:32:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:27,226 INFO L225 Difference]: With dead ends: 62 [2020-08-19 03:32:27,226 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 03:32:27,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 03:32:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 03:32:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 03:32:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 03:32:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 03:32:27,241 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 03:32:27,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:27,242 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 03:32:27,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 03:32:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 03:32:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 03:32:27,246 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:27,247 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:27,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 03:32:27,247 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 03:32:27,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:27,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409103904] [2020-08-19 03:32:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-19 03:32:27,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409103904] [2020-08-19 03:32:27,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:27,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 03:32:27,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485300670] [2020-08-19 03:32:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 03:32:27,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 03:32:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 03:32:27,552 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 03:32:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:27,744 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 03:32:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 03:32:27,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 03:32:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:27,750 INFO L225 Difference]: With dead ends: 97 [2020-08-19 03:32:27,750 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 03:32:27,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-19 03:32:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 03:32:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 03:32:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 03:32:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 03:32:27,772 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 03:32:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:27,773 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 03:32:27,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 03:32:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 03:32:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 03:32:27,780 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:27,780 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:27,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 03:32:27,781 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 03:32:27,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:27,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442811320] [2020-08-19 03:32:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:27,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-19 03:32:28,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442811320] [2020-08-19 03:32:28,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 03:32:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361880504] [2020-08-19 03:32:28,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 03:32:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 03:32:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 03:32:28,401 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 03:32:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:28,787 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 03:32:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 03:32:28,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 03:32:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:28,790 INFO L225 Difference]: With dead ends: 153 [2020-08-19 03:32:28,790 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 03:32:28,793 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-19 03:32:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 03:32:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 03:32:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 03:32:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 03:32:28,808 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 03:32:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:28,809 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 03:32:28,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 03:32:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 03:32:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 03:32:28,814 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:28,814 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:28,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 03:32:28,814 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 03:32:28,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:28,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1415474749] [2020-08-19 03:32:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:28,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-19 03:32:29,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1415474749] [2020-08-19 03:32:29,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:29,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 03:32:29,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952311925] [2020-08-19 03:32:29,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 03:32:29,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 03:32:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 03:32:29,069 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 03:32:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:29,245 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 03:32:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 03:32:29,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 03:32:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:29,247 INFO L225 Difference]: With dead ends: 68 [2020-08-19 03:32:29,247 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 03:32:29,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 03:32:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 03:32:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 03:32:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 03:32:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 03:32:29,257 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 03:32:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:29,257 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 03:32:29,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 03:32:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 03:32:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 03:32:29,259 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:29,259 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:29,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 03:32:29,260 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 03:32:29,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:29,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2018850117] [2020-08-19 03:32:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 03:32:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 03:32:29,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2018850117] [2020-08-19 03:32:29,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:29,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 03:32:29,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070126252] [2020-08-19 03:32:29,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 03:32:29,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:29,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 03:32:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 03:32:29,655 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 03:32:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:29,877 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 03:32:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 03:32:29,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 03:32:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:29,882 INFO L225 Difference]: With dead ends: 180 [2020-08-19 03:32:29,882 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 03:32:29,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 03:32:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 03:32:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 03:32:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 03:32:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 03:32:29,924 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 03:32:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:29,927 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 03:32:29,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 03:32:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 03:32:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 03:32:29,936 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:29,937 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:29,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 03:32:29,937 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:29,938 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 03:32:29,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:29,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [20341751] [2020-08-19 03:32:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 03:32:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 03:32:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 03:32:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 03:32:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 03:32:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 03:32:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 03:32:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 03:32:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 03:32:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 03:32:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-19 03:32:30,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [20341751] [2020-08-19 03:32:30,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 03:32:30,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 03:32:30,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605085457] [2020-08-19 03:32:30,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 03:32:30,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 03:32:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 03:32:30,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 03:32:30,762 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 03:32:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 03:32:31,132 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 03:32:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 03:32:31,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 03:32:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 03:32:31,140 INFO L225 Difference]: With dead ends: 410 [2020-08-19 03:32:31,140 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 03:32:31,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-19 03:32:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 03:32:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 03:32:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 03:32:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 03:32:31,194 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 03:32:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 03:32:31,195 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 03:32:31,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 03:32:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 03:32:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 03:32:31,205 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 03:32:31,206 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 03:32:31,206 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 03:32:31,206 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 03:32:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 03:32:31,207 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-19 03:32:31,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 03:32:31,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344933988] [2020-08-19 03:32:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 03:32:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 03:32:31,358 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 03:32:31,358 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 03:32:31,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 03:32:31,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 03:32:31 BoogieIcfgContainer [2020-08-19 03:32:31,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 03:32:31,448 INFO L168 Benchmark]: Toolchain (without parser) took 6733.58 ms. Allocated memory was 140.0 MB in the beginning and 361.2 MB in the end (delta: 221.2 MB). Free memory was 103.1 MB in the beginning and 152.2 MB in the end (delta: -49.0 MB). Peak memory consumption was 172.2 MB. Max. memory is 7.1 GB. [2020-08-19 03:32:31,449 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-19 03:32:31,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.23 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 93.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-08-19 03:32:31,451 INFO L168 Benchmark]: Boogie Preprocessor took 26.50 ms. Allocated memory is still 140.0 MB. Free memory was 93.6 MB in the beginning and 92.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-19 03:32:31,452 INFO L168 Benchmark]: RCFGBuilder took 346.07 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 92.0 MB in the beginning and 170.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-19 03:32:31,453 INFO L168 Benchmark]: TraceAbstraction took 6128.07 ms. Allocated memory was 202.9 MB in the beginning and 361.2 MB in the end (delta: 158.3 MB). Free memory was 169.7 MB in the beginning and 152.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 175.8 MB. Max. memory is 7.1 GB. [2020-08-19 03:32:31,456 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.23 ms. Allocated memory is still 140.0 MB. Free memory was 102.7 MB in the beginning and 93.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.50 ms. Allocated memory is still 140.0 MB. Free memory was 93.6 MB in the beginning and 92.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.07 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 92.0 MB in the beginning and 170.3 MB in the end (delta: -78.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6128.07 ms. Allocated memory was 202.9 MB in the beginning and 361.2 MB in the end (delta: 158.3 MB). Free memory was 169.7 MB in the beginning and 152.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 175.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 894 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...