/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=BIGGEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 17:51:00,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 17:51:00,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 17:51:00,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 17:51:00,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 17:51:00,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 17:51:00,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 17:51:00,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 17:51:00,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 17:51:00,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 17:51:00,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 17:51:00,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 17:51:00,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 17:51:00,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 17:51:00,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 17:51:00,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 17:51:00,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 17:51:00,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 17:51:00,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 17:51:00,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 17:51:00,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 17:51:00,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 17:51:00,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 17:51:00,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 17:51:00,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 17:51:00,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 17:51:00,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 17:51:00,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 17:51:00,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 17:51:00,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 17:51:00,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 17:51:00,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 17:51:00,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 17:51:00,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 17:51:00,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 17:51:00,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 17:51:00,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 17:51:00,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 17:51:00,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 17:51:00,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 17:51:00,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 17:51:00,872 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-18 17:51:00,895 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 17:51:00,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 17:51:00,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 17:51:00,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 17:51:00,897 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 17:51:00,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 17:51:00,898 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 17:51:00,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 17:51:00,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 17:51:00,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 17:51:00,900 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 17:51:00,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 17:51:00,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 17:51:00,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 17:51:00,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 17:51:00,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 17:51:00,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 17:51:00,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 17:51:00,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 17:51:00,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 17:51:00,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 17:51:00,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 17:51:00,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 17:51:00,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 17:51:00,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=BIGGEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=BIGGEST; [2020-08-18 17:51:01,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 17:51:01,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 17:51:01,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 17:51:01,254 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 17:51:01,254 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 17:51:01,255 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-18 17:51:01,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3816e386e/cd8b3eacb8b74a1ebf07357a9ee6d5ef/FLAG6b09603ae [2020-08-18 17:51:01,814 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 17:51:01,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 17:51:01,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3816e386e/cd8b3eacb8b74a1ebf07357a9ee6d5ef/FLAG6b09603ae [2020-08-18 17:51:02,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3816e386e/cd8b3eacb8b74a1ebf07357a9ee6d5ef [2020-08-18 17:51:02,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 17:51:02,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 17:51:02,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 17:51:02,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 17:51:02,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 17:51:02,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf15244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02, skipping insertion in model container [2020-08-18 17:51:02,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 17:51:02,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 17:51:02,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:51:02,429 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 17:51:02,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 17:51:02,459 INFO L208 MainTranslator]: Completed translation [2020-08-18 17:51:02,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02 WrapperNode [2020-08-18 17:51:02,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 17:51:02,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 17:51:02,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 17:51:02,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 17:51:02,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (1/1) ... [2020-08-18 17:51:02,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 17:51:02,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 17:51:02,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 17:51:02,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 17:51:02,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (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-18 17:51:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 17:51:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 17:51:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 17:51:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 17:51:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 17:51:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 17:51:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 17:51:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 17:51:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 17:51:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 17:51:02,820 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 17:51:02,820 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 17:51:02,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:51:02 BoogieIcfgContainer [2020-08-18 17:51:02,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 17:51:02,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 17:51:02,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 17:51:02,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 17:51:02,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 05:51:02" (1/3) ... [2020-08-18 17:51:02,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e842e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:51:02, skipping insertion in model container [2020-08-18 17:51:02,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 05:51:02" (2/3) ... [2020-08-18 17:51:02,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e842e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 05:51:02, skipping insertion in model container [2020-08-18 17:51:02,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 05:51:02" (3/3) ... [2020-08-18 17:51:02,834 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 17:51:02,846 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 17:51:02,859 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 17:51:02,915 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 17:51:02,961 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 17:51:02,962 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 17:51:02,962 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 17:51:02,962 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 17:51:02,962 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 17:51:02,963 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 17:51:02,963 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 17:51:02,963 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 17:51:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 17:51:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 17:51:03,008 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:03,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:51:03,009 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 17:51:03,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:03,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931219472] [2020-08-18 17:51:03,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,278 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-18 17:51:03,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931219472] [2020-08-18 17:51:03,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:51:03,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 17:51:03,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031868275] [2020-08-18 17:51:03,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 17:51:03,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 17:51:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:51:03,310 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 17:51:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:03,429 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 17:51:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:51:03,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 17:51:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:03,441 INFO L225 Difference]: With dead ends: 35 [2020-08-18 17:51:03,441 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 17:51:03,445 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-18 17:51:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 17:51:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 17:51:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 17:51:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 17:51:03,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 17:51:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:03,488 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 17:51:03,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 17:51:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 17:51:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 17:51:03,490 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:03,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 17:51:03,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 17:51:03,492 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 17:51:03,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:03,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932210045] [2020-08-18 17:51:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,564 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-18 17:51:03,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932210045] [2020-08-18 17:51:03,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 17:51:03,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 17:51:03,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258891168] [2020-08-18 17:51:03,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 17:51:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 17:51:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 17:51:03,569 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 17:51:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:03,632 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 17:51:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 17:51:03,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 17:51:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:03,634 INFO L225 Difference]: With dead ends: 27 [2020-08-18 17:51:03,634 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 17:51:03,636 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-18 17:51:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 17:51:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 17:51:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 17:51:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 17:51:03,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 17:51:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:03,645 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 17:51:03,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 17:51:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 17:51:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 17:51:03,647 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:03,647 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-18 17:51:03,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 17:51:03,648 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:03,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 17:51:03,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:03,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474650450] [2020-08-18 17:51:03,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 17:51:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,776 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-18 17:51:03,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474650450] [2020-08-18 17:51:03,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:03,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 17:51:03,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105548136] [2020-08-18 17:51:03,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:51:03,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:51:03,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:51:03,779 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 17:51:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:03,876 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 17:51:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 17:51:03,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 17:51:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:03,878 INFO L225 Difference]: With dead ends: 38 [2020-08-18 17:51:03,879 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 17:51:03,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:51:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 17:51:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 17:51:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 17:51:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 17:51:03,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 17:51:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:03,888 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 17:51:03,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:51:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 17:51:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 17:51:03,890 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:03,890 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-18 17:51:03,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 17:51:03,891 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 17:51:03,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:03,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [993515146] [2020-08-18 17:51:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:03,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,057 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-18 17:51:04,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [993515146] [2020-08-18 17:51:04,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:04,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 17:51:04,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361806422] [2020-08-18 17:51:04,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 17:51:04,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:04,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 17:51:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 17:51:04,061 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 17:51:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:04,187 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 17:51:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 17:51:04,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 17:51:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:04,190 INFO L225 Difference]: With dead ends: 41 [2020-08-18 17:51:04,191 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 17:51:04,191 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-18 17:51:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 17:51:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 17:51:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 17:51:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 17:51:04,203 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 17:51:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:04,204 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 17:51:04,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 17:51:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 17:51:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 17:51:04,206 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:04,207 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-18 17:51:04,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 17:51:04,207 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:04,208 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 17:51:04,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:04,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452135298] [2020-08-18 17:51:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,450 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-18 17:51:04,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452135298] [2020-08-18 17:51:04,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:04,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 17:51:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270944487] [2020-08-18 17:51:04,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 17:51:04,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 17:51:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:51:04,456 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 17:51:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:04,601 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 17:51:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 17:51:04,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 17:51:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:04,608 INFO L225 Difference]: With dead ends: 76 [2020-08-18 17:51:04,608 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 17:51:04,611 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-18 17:51:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 17:51:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 17:51:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 17:51:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 17:51:04,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 17:51:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:04,628 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 17:51:04,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 17:51:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 17:51:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 17:51:04,630 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:04,630 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-18 17:51:04,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 17:51:04,631 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:04,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 17:51:04,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:04,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1056548008] [2020-08-18 17:51:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,737 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-18 17:51:04,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1056548008] [2020-08-18 17:51:04,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:04,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 17:51:04,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896457285] [2020-08-18 17:51:04,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 17:51:04,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 17:51:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 17:51:04,740 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 17:51:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:04,853 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 17:51:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 17:51:04,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 17:51:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:04,856 INFO L225 Difference]: With dead ends: 62 [2020-08-18 17:51:04,856 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 17:51:04,857 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-18 17:51:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 17:51:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 17:51:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 17:51:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 17:51:04,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 17:51:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:04,875 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 17:51:04,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 17:51:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 17:51:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 17:51:04,880 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:04,880 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-18 17:51:04,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 17:51:04,881 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 17:51:04,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:04,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141654478] [2020-08-18 17:51:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:04,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,229 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-18 17:51:05,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141654478] [2020-08-18 17:51:05,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:05,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 17:51:05,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853802486] [2020-08-18 17:51:05,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 17:51:05,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:05,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 17:51:05,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 17:51:05,234 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 17:51:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:05,380 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 17:51:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 17:51:05,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 17:51:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:05,385 INFO L225 Difference]: With dead ends: 97 [2020-08-18 17:51:05,385 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 17:51:05,386 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-18 17:51:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 17:51:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 17:51:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 17:51:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 17:51:05,407 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 17:51:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:05,408 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 17:51:05,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 17:51:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 17:51:05,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 17:51:05,415 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:05,416 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-18 17:51:05,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 17:51:05,416 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 17:51:05,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:05,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109325029] [2020-08-18 17:51:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:05,871 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-18 17:51:05,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109325029] [2020-08-18 17:51:05,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:05,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 17:51:05,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291261723] [2020-08-18 17:51:05,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 17:51:05,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 17:51:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 17:51:05,874 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 17:51:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:06,290 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 17:51:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 17:51:06,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 17:51:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:06,293 INFO L225 Difference]: With dead ends: 153 [2020-08-18 17:51:06,293 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 17:51:06,296 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-18 17:51:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 17:51:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 17:51:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 17:51:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 17:51:06,306 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 17:51:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:06,307 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 17:51:06,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 17:51:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 17:51:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 17:51:06,309 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:06,309 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-18 17:51:06,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 17:51:06,310 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 17:51:06,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:06,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2024506003] [2020-08-18 17:51:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,567 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-18 17:51:06,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2024506003] [2020-08-18 17:51:06,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:06,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 17:51:06,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949812407] [2020-08-18 17:51:06,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 17:51:06,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 17:51:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 17:51:06,570 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 17:51:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:06,730 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 17:51:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 17:51:06,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 17:51:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:06,732 INFO L225 Difference]: With dead ends: 68 [2020-08-18 17:51:06,732 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 17:51:06,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 17:51:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 17:51:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 17:51:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 17:51:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 17:51:06,743 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 17:51:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:06,744 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 17:51:06,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 17:51:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 17:51:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 17:51:06,746 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:06,746 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-18 17:51:06,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 17:51:06,746 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 17:51:06,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:06,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623355701] [2020-08-18 17:51:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:06,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:51:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,186 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-18 17:51:07,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623355701] [2020-08-18 17:51:07,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:07,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 17:51:07,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162635004] [2020-08-18 17:51:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 17:51:07,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 17:51:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 17:51:07,189 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 17:51:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:07,408 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 17:51:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 17:51:07,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 17:51:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:07,411 INFO L225 Difference]: With dead ends: 180 [2020-08-18 17:51:07,412 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 17:51:07,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 17:51:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 17:51:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 17:51:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 17:51:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 17:51:07,434 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 17:51:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:07,435 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 17:51:07,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 17:51:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 17:51:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 17:51:07,438 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:07,438 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-18 17:51:07,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 17:51:07,439 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 17:51:07,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:07,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [61431634] [2020-08-18 17:51:07,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:51:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:07,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:51:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:08,352 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-18 17:51:08,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [61431634] [2020-08-18 17:51:08,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:08,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 17:51:08,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295451118] [2020-08-18 17:51:08,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 17:51:08,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 17:51:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 17:51:08,356 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 17:51:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:08,638 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 17:51:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 17:51:08,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 17:51:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:08,647 INFO L225 Difference]: With dead ends: 410 [2020-08-18 17:51:08,647 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 17:51:08,649 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-18 17:51:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 17:51:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 17:51:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 17:51:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 17:51:08,724 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 17:51:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:08,726 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 17:51:08,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 17:51:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 17:51:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 17:51:08,742 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:08,743 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-18 17:51:08,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 17:51:08,743 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:08,744 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 17:51:08,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:08,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781255070] [2020-08-18 17:51:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 17:51:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 17:51:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:51:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:51:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 17:51:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:09,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 17:51:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 17:51:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 17:51:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 17:51:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 17:51:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 17:51:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 17:51:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 17:51:10,783 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-18 17:51:10,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781255070] [2020-08-18 17:51:10,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 17:51:10,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 17:51:10,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573235775] [2020-08-18 17:51:10,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 17:51:10,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 17:51:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 17:51:10,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 17:51:10,787 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 17:51:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 17:51:11,692 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 17:51:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 17:51:11,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 17:51:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 17:51:11,696 INFO L225 Difference]: With dead ends: 531 [2020-08-18 17:51:11,696 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 17:51:11,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-18 17:51:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 17:51:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 17:51:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 17:51:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 17:51:11,712 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 17:51:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 17:51:11,713 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 17:51:11,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 17:51:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 17:51:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 17:51:11,722 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 17:51:11,722 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-18 17:51:11,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 17:51:11,723 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 17:51:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 17:51:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 17:51:11,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 17:51:11,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158361523] [2020-08-18 17:51:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 17:51:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 17:51:11,854 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 17:51:11,854 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 17:51:11,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 17:51:11,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 05:51:11 BoogieIcfgContainer [2020-08-18 17:51:11,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 17:51:11,913 INFO L168 Benchmark]: Toolchain (without parser) took 9721.16 ms. Allocated memory was 140.5 MB in the beginning and 543.7 MB in the end (delta: 403.2 MB). Free memory was 103.7 MB in the beginning and 321.2 MB in the end (delta: -217.5 MB). Peak memory consumption was 185.7 MB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,914 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.20 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 94.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,916 INFO L168 Benchmark]: Boogie Preprocessor took 108.27 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 94.2 MB in the beginning and 180.9 MB in the end (delta: -86.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,917 INFO L168 Benchmark]: RCFGBuilder took 255.95 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 169.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,918 INFO L168 Benchmark]: TraceAbstraction took 9084.64 ms. Allocated memory was 202.4 MB in the beginning and 543.7 MB in the end (delta: 341.3 MB). Free memory was 168.2 MB in the beginning and 321.2 MB in the end (delta: -153.0 MB). Peak memory consumption was 188.3 MB. Max. memory is 7.1 GB. [2020-08-18 17:51:11,921 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.20 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 94.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.27 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 94.2 MB in the beginning and 180.9 MB in the end (delta: -86.7 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.95 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 169.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9084.64 ms. Allocated memory was 202.4 MB in the beginning and 543.7 MB in the end (delta: 341.3 MB). Free memory was 168.2 MB in the beginning and 321.2 MB in the end (delta: -153.0 MB). Peak memory consumption was 188.3 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1348 SolverSat, 482 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.5s 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.6s 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...