/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=HIGHLEXORDER --traceabstraction.additional.smt.options log-additional-information=true -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-177f698 [2020-08-21 18:54:44,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 18:54:44,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 18:54:44,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 18:54:44,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 18:54:44,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 18:54:44,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 18:54:44,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 18:54:44,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 18:54:44,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 18:54:44,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 18:54:44,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 18:54:44,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 18:54:44,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 18:54:44,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 18:54:44,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 18:54:44,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 18:54:44,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 18:54:44,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 18:54:44,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 18:54:44,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 18:54:44,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 18:54:44,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 18:54:44,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 18:54:44,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 18:54:44,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 18:54:44,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 18:54:44,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 18:54:44,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 18:54:44,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 18:54:44,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 18:54:44,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 18:54:44,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 18:54:44,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 18:54:44,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 18:54:44,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 18:54:44,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 18:54:44,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 18:54:44,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 18:54:44,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 18:54:44,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 18:54:44,849 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-21 18:54:44,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 18:54:44,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 18:54:44,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 18:54:44,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 18:54:44,893 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 18:54:44,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 18:54:44,895 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 18:54:44,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 18:54:44,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 18:54:44,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 18:54:44,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 18:54:44,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 18:54:44,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 18:54:44,896 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 18:54:44,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 18:54:44,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 18:54:44,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 18:54:44,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 18:54:44,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 18:54:44,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 18:54:44,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 18:54:44,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 18:54:44,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 18:54:44,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 18:54:44,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 18:54:44,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 18:54:44,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 18:54:44,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 18:54:44,901 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 18:54:44,902 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=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=HIGHLEXORDER;log-additional-information=true; [2020-08-21 18:54:45,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 18:54:45,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 18:54:45,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 18:54:45,222 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 18:54:45,222 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 18:54:45,223 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-21 18:54:45,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1e7237a51/10756001ab13406a89e14e45a9975326/FLAG969289622 [2020-08-21 18:54:45,740 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 18:54:45,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-21 18:54:45,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1e7237a51/10756001ab13406a89e14e45a9975326/FLAG969289622 [2020-08-21 18:54:46,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1e7237a51/10756001ab13406a89e14e45a9975326 [2020-08-21 18:54:46,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 18:54:46,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 18:54:46,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 18:54:46,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 18:54:46,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 18:54:46,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157daaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46, skipping insertion in model container [2020-08-21 18:54:46,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 18:54:46,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 18:54:46,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:54:46,420 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 18:54:46,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 18:54:46,455 INFO L208 MainTranslator]: Completed translation [2020-08-21 18:54:46,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46 WrapperNode [2020-08-21 18:54:46,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 18:54:46,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 18:54:46,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 18:54:46,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 18:54:46,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (1/1) ... [2020-08-21 18:54:46,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 18:54:46,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 18:54:46,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 18:54:46,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 18:54:46,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (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-21 18:54:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 18:54:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 18:54:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-21 18:54:46,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 18:54:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 18:54:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 18:54:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-21 18:54:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 18:54:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 18:54:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 18:54:46,838 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 18:54:46,838 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 18:54:46,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:54:46 BoogieIcfgContainer [2020-08-21 18:54:46,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 18:54:46,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 18:54:46,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 18:54:46,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 18:54:46,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 06:54:46" (1/3) ... [2020-08-21 18:54:46,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bb246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:54:46, skipping insertion in model container [2020-08-21 18:54:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 06:54:46" (2/3) ... [2020-08-21 18:54:46,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bb246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 06:54:46, skipping insertion in model container [2020-08-21 18:54:46,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 06:54:46" (3/3) ... [2020-08-21 18:54:46,855 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-21 18:54:46,879 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 18:54:46,897 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 18:54:46,928 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 18:54:46,960 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 18:54:46,961 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 18:54:46,961 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 18:54:46,961 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 18:54:46,961 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 18:54:46,961 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 18:54:46,962 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 18:54:46,962 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 18:54:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-21 18:54:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-21 18:54:46,989 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:46,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:54:46,991 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-21 18:54:47,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:47,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503899644] [2020-08-21 18:54:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,252 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-21 18:54:47,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503899644] [2020-08-21 18:54:47,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:54:47,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:54:47,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872028148] [2020-08-21 18:54:47,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:54:47,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:47,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:54:47,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:54:47,276 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-21 18:54:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:47,393 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-21 18:54:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:54:47,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-21 18:54:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:47,407 INFO L225 Difference]: With dead ends: 35 [2020-08-21 18:54:47,415 INFO L226 Difference]: Without dead ends: 21 [2020-08-21 18:54:47,419 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-21 18:54:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-21 18:54:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-21 18:54:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:54:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:54:47,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-21 18:54:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:47,466 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:54:47,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:54:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:54:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-21 18:54:47,469 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:47,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:54:47,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 18:54:47,470 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-21 18:54:47,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:47,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803257562] [2020-08-21 18:54:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,546 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-21 18:54:47,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803257562] [2020-08-21 18:54:47,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 18:54:47,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 18:54:47,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496620938] [2020-08-21 18:54:47,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 18:54:47,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:47,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 18:54:47,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-21 18:54:47,552 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-21 18:54:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:47,619 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-21 18:54:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 18:54:47,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-21 18:54:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:47,622 INFO L225 Difference]: With dead ends: 27 [2020-08-21 18:54:47,622 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:54:47,623 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-21 18:54:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:54:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-21 18:54:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-21 18:54:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-21 18:54:47,631 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-21 18:54:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:47,632 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-21 18:54:47,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 18:54:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-21 18:54:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 18:54:47,633 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:47,634 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-21 18:54:47,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 18:54:47,634 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:47,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:47,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-21 18:54:47,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:47,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597273115] [2020-08-21 18:54:47,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-21 18:54:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:47,758 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-21 18:54:47,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597273115] [2020-08-21 18:54:47,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:47,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 18:54:47,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869081377] [2020-08-21 18:54:47,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 18:54:47,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:47,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 18:54:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:54:47,761 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-21 18:54:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:47,966 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-21 18:54:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 18:54:47,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 18:54:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:47,968 INFO L225 Difference]: With dead ends: 38 [2020-08-21 18:54:47,969 INFO L226 Difference]: Without dead ends: 23 [2020-08-21 18:54:47,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-21 18:54:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-21 18:54:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-21 18:54:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-21 18:54:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-21 18:54:47,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-21 18:54:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:47,979 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-21 18:54:47,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 18:54:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-21 18:54:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 18:54:47,981 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:47,981 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-21 18:54:47,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 18:54:47,982 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-21 18:54:47,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:47,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [332293548] [2020-08-21 18:54:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,180 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-21 18:54:48,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [332293548] [2020-08-21 18:54:48,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:48,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-21 18:54:48,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111352201] [2020-08-21 18:54:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 18:54:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 18:54:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-21 18:54:48,183 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-21 18:54:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:48,305 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-21 18:54:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:54:48,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 18:54:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:48,308 INFO L225 Difference]: With dead ends: 41 [2020-08-21 18:54:48,308 INFO L226 Difference]: Without dead ends: 37 [2020-08-21 18:54:48,309 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-21 18:54:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-21 18:54:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-21 18:54:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-21 18:54:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-21 18:54:48,321 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-21 18:54:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:48,322 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-21 18:54:48,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 18:54:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-21 18:54:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-21 18:54:48,324 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:48,325 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-21 18:54:48,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 18:54:48,325 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:48,326 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-21 18:54:48,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:48,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299502330] [2020-08-21 18:54:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,582 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-21 18:54:48,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299502330] [2020-08-21 18:54:48,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:48,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:54:48,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543210141] [2020-08-21 18:54:48,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:54:48,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:54:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:54:48,587 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-21 18:54:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:48,735 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-21 18:54:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 18:54:48,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-21 18:54:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:48,744 INFO L225 Difference]: With dead ends: 76 [2020-08-21 18:54:48,745 INFO L226 Difference]: Without dead ends: 45 [2020-08-21 18:54:48,747 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-21 18:54:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-21 18:54:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-21 18:54:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-21 18:54:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-21 18:54:48,773 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-21 18:54:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:48,774 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-21 18:54:48,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:54:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-21 18:54:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-21 18:54:48,779 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:48,779 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-21 18:54:48,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 18:54:48,781 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-21 18:54:48,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:48,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774928056] [2020-08-21 18:54:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:48,941 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-21 18:54:48,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774928056] [2020-08-21 18:54:48,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:48,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-21 18:54:48,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708542607] [2020-08-21 18:54:48,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-21 18:54:48,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:48,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-21 18:54:48,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-21 18:54:48,944 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-21 18:54:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:49,070 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-21 18:54:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 18:54:49,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-21 18:54:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:49,073 INFO L225 Difference]: With dead ends: 62 [2020-08-21 18:54:49,073 INFO L226 Difference]: Without dead ends: 58 [2020-08-21 18:54:49,074 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-21 18:54:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-21 18:54:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-21 18:54:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-21 18:54:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-21 18:54:49,089 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-21 18:54:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:49,090 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-21 18:54:49,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-21 18:54:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-21 18:54:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-21 18:54:49,094 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:49,095 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-21 18:54:49,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 18:54:49,095 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:49,096 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-21 18:54:49,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:49,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351159017] [2020-08-21 18:54:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,492 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-21 18:54:49,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351159017] [2020-08-21 18:54:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-21 18:54:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878186840] [2020-08-21 18:54:49,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 18:54:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 18:54:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 18:54:49,495 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-21 18:54:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:49,661 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-21 18:54:49,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 18:54:49,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-21 18:54:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:49,666 INFO L225 Difference]: With dead ends: 97 [2020-08-21 18:54:49,666 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 18:54:49,667 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-21 18:54:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 18:54:49,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-21 18:54:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-21 18:54:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-21 18:54:49,687 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-21 18:54:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:49,687 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-21 18:54:49,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 18:54:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-21 18:54:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-21 18:54:49,695 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:49,696 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-21 18:54:49,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 18:54:49,696 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-21 18:54:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:49,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454211306] [2020-08-21 18:54:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:49,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,101 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-21 18:54:50,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454211306] [2020-08-21 18:54:50,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:50,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-21 18:54:50,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765280176] [2020-08-21 18:54:50,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 18:54:50,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 18:54:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-21 18:54:50,104 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-21 18:54:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:50,497 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-21 18:54:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-21 18:54:50,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-21 18:54:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:50,500 INFO L225 Difference]: With dead ends: 153 [2020-08-21 18:54:50,500 INFO L226 Difference]: Without dead ends: 71 [2020-08-21 18:54:50,507 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-21 18:54:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-21 18:54:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-21 18:54:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-21 18:54:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-21 18:54:50,517 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-21 18:54:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:50,517 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-21 18:54:50,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 18:54:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-21 18:54:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-21 18:54:50,519 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:50,520 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-21 18:54:50,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 18:54:50,520 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-21 18:54:50,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:50,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205988196] [2020-08-21 18:54:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:50,836 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-21 18:54:50,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205988196] [2020-08-21 18:54:50,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:50,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-21 18:54:50,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949766818] [2020-08-21 18:54:50,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 18:54:50,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 18:54:50,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-21 18:54:50,839 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-21 18:54:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:50,990 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-21 18:54:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-21 18:54:50,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-21 18:54:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:50,992 INFO L225 Difference]: With dead ends: 68 [2020-08-21 18:54:50,992 INFO L226 Difference]: Without dead ends: 64 [2020-08-21 18:54:50,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-21 18:54:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-21 18:54:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-21 18:54:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-21 18:54:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-21 18:54:51,002 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-21 18:54:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:51,002 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-21 18:54:51,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 18:54:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-21 18:54:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-21 18:54:51,004 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:51,004 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-21 18:54:51,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 18:54:51,005 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-21 18:54:51,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:51,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1439859909] [2020-08-21 18:54:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:54:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,403 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-21 18:54:51,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1439859909] [2020-08-21 18:54:51,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:51,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-21 18:54:51,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993687912] [2020-08-21 18:54:51,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 18:54:51,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 18:54:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-21 18:54:51,408 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-21 18:54:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:51,631 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-21 18:54:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-21 18:54:51,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-21 18:54:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:51,637 INFO L225 Difference]: With dead ends: 180 [2020-08-21 18:54:51,637 INFO L226 Difference]: Without dead ends: 176 [2020-08-21 18:54:51,638 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-21 18:54:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-21 18:54:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-21 18:54:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-21 18:54:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-21 18:54:51,690 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-21 18:54:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:51,692 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-21 18:54:51,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 18:54:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-21 18:54:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-21 18:54:51,695 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:51,699 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-21 18:54:51,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 18:54:51,700 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-21 18:54:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:51,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [493523356] [2020-08-21 18:54:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:51,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:54:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:54:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:52,532 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-21 18:54:52,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [493523356] [2020-08-21 18:54:52,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:52,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-21 18:54:52,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271735983] [2020-08-21 18:54:52,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 18:54:52,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 18:54:52,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-21 18:54:52,535 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-21 18:54:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:52,837 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-21 18:54:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-21 18:54:52,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-21 18:54:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:52,845 INFO L225 Difference]: With dead ends: 410 [2020-08-21 18:54:52,845 INFO L226 Difference]: Without dead ends: 406 [2020-08-21 18:54:52,847 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-21 18:54:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-21 18:54:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-21 18:54:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-21 18:54:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-21 18:54:52,922 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-21 18:54:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:52,923 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-21 18:54:52,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 18:54:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-21 18:54:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-21 18:54:52,949 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:52,950 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 18:54:52,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 18:54:52,951 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-21 18:54:52,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:52,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059129875] [2020-08-21 18:54:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 18:54:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-21 18:54:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:54:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:53,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:54:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-21 18:54:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-21 18:54:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-21 18:54:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-21 18:54:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-21 18:54:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-21 18:54:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-21 18:54:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:54,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-21 18:54:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 18:54:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-21 18:54:55,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059129875] [2020-08-21 18:54:55,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-21 18:54:55,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-21 18:54:55,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842761004] [2020-08-21 18:54:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-21 18:54:55,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 18:54:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-21 18:54:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-21 18:54:55,137 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-21 18:54:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 18:54:56,059 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-21 18:54:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-21 18:54:56,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-21 18:54:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 18:54:56,067 INFO L225 Difference]: With dead ends: 531 [2020-08-21 18:54:56,067 INFO L226 Difference]: Without dead ends: 148 [2020-08-21 18:54:56,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-21 18:54:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-21 18:54:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-21 18:54:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-21 18:54:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-21 18:54:56,084 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-21 18:54:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 18:54:56,085 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-21 18:54:56,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-21 18:54:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-21 18:54:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-21 18:54:56,094 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 18:54:56,094 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-21 18:54:56,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 18:54:56,094 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 18:54:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 18:54:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-21 18:54:56,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 18:54:56,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776700389] [2020-08-21 18:54:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 18:54:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-21 18:54:56,217 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-21 18:54:56,218 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-21 18:54:56,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 18:54:56,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 06:54:56 BoogieIcfgContainer [2020-08-21 18:54:56,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 18:54:56,318 INFO L168 Benchmark]: Toolchain (without parser) took 10189.51 ms. Allocated memory was 140.5 MB in the beginning and 497.5 MB in the end (delta: 357.0 MB). Free memory was 103.6 MB in the beginning and 137.0 MB in the end (delta: -33.4 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,319 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.96 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,321 INFO L168 Benchmark]: Boogie Preprocessor took 125.66 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 94.0 MB in the beginning and 181.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,321 INFO L168 Benchmark]: RCFGBuilder took 260.07 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 169.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,322 INFO L168 Benchmark]: TraceAbstraction took 9470.08 ms. Allocated memory was 202.9 MB in the beginning and 497.5 MB in the end (delta: 294.6 MB). Free memory was 169.5 MB in the beginning and 137.0 MB in the end (delta: 32.5 MB). Peak memory consumption was 327.2 MB. Max. memory is 7.1 GB. [2020-08-21 18:54:56,326 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.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.96 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 94.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.66 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 94.0 MB in the beginning and 181.6 MB in the end (delta: -87.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 260.07 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 169.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9470.08 ms. Allocated memory was 202.9 MB in the beginning and 497.5 MB in the end (delta: 294.6 MB). Free memory was 169.5 MB in the beginning and 137.0 MB in the end (delta: 32.5 MB). Peak memory consumption was 327.2 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: 9.2s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1340 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.7s 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, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...