/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=LOWLEXORDER -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 18:39:30,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 18:39:30,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 18:39:30,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 18:39:30,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 18:39:30,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 18:39:30,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 18:39:30,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 18:39:30,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 18:39:30,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 18:39:30,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 18:39:30,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 18:39:30,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 18:39:30,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 18:39:30,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 18:39:30,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 18:39:30,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 18:39:30,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 18:39:30,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 18:39:30,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 18:39:30,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 18:39:30,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 18:39:30,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 18:39:30,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 18:39:31,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 18:39:31,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 18:39:31,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 18:39:31,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 18:39:31,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 18:39:31,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 18:39:31,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 18:39:31,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 18:39:31,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 18:39:31,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 18:39:31,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 18:39:31,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 18:39:31,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 18:39:31,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 18:39:31,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 18:39:31,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 18:39:31,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 18:39:31,013 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 18:39:31,038 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 18:39:31,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 18:39:31,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 18:39:31,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 18:39:31,041 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 18:39:31,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 18:39:31,041 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 18:39:31,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 18:39:31,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 18:39:31,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 18:39:31,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 18:39:31,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 18:39:31,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 18:39:31,043 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 18:39:31,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 18:39:31,043 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 18:39:31,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 18:39:31,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 18:39:31,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 18:39:31,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 18:39:31,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 18:39:31,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 18:39:31,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 18:39:31,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 18:39:31,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 18:39:31,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 18:39:31,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 18:39:31,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 18:39:31,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 18:39:31,046 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=LOWLEXORDER; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=LOWLEXORDER; [2020-08-18 18:39:31,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 18:39:31,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 18:39:31,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 18:39:31,412 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 18:39:31,413 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 18:39:31,413 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 18:39:31,490 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1448f4362/1d855c02c8184f1099e318867c84981a/FLAG3964f52e4 [2020-08-18 18:39:31,955 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 18:39:31,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 18:39:31,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1448f4362/1d855c02c8184f1099e318867c84981a/FLAG3964f52e4 [2020-08-18 18:39:32,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1448f4362/1d855c02c8184f1099e318867c84981a [2020-08-18 18:39:32,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 18:39:32,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 18:39:32,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 18:39:32,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 18:39:32,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 18:39:32,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7105da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32, skipping insertion in model container [2020-08-18 18:39:32,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 18:39:32,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 18:39:32,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 18:39:32,521 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 18:39:32,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 18:39:32,545 INFO L208 MainTranslator]: Completed translation [2020-08-18 18:39:32,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32 WrapperNode [2020-08-18 18:39:32,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 18:39:32,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 18:39:32,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 18:39:32,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 18:39:32,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (1/1) ... [2020-08-18 18:39:32,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 18:39:32,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 18:39:32,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 18:39:32,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 18:39:32,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (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 18:39:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 18:39:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 18:39:32,716 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-18 18:39:32,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 18:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 18:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 18:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-18 18:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 18:39:32,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 18:39:32,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 18:39:32,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 18:39:32,888 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 18:39:32,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 06:39:32 BoogieIcfgContainer [2020-08-18 18:39:32,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 18:39:32,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 18:39:32,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 18:39:32,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 18:39:32,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 06:39:32" (1/3) ... [2020-08-18 18:39:32,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1771ec44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 06:39:32, skipping insertion in model container [2020-08-18 18:39:32,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 06:39:32" (2/3) ... [2020-08-18 18:39:32,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1771ec44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 06:39:32, skipping insertion in model container [2020-08-18 18:39:32,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 06:39:32" (3/3) ... [2020-08-18 18:39:32,907 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-18 18:39:32,918 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 18:39:32,924 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 18:39:32,938 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 18:39:32,962 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 18:39:32,963 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 18:39:32,963 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 18:39:32,963 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 18:39:32,963 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 18:39:32,963 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 18:39:32,963 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 18:39:32,964 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 18:39:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-18 18:39:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 18:39:32,985 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:32,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:32,987 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-18 18:39:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:33,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302620294] [2020-08-18 18:39:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,400 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 18:39:33,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302620294] [2020-08-18 18:39:33,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 18:39:33,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 18:39:33,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670970247] [2020-08-18 18:39:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 18:39:33,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 18:39:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 18:39:33,436 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-18 18:39:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:33,572 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 18:39:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 18:39:33,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 18:39:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:33,584 INFO L225 Difference]: With dead ends: 35 [2020-08-18 18:39:33,584 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 18:39:33,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 18:39:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 18:39:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 18:39:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 18:39:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 18:39:33,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 18:39:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:33,634 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 18:39:33,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 18:39:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 18:39:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 18:39:33,638 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:33,638 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:33,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 18:39:33,639 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-18 18:39:33,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:33,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821926115] [2020-08-18 18:39:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,710 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 18:39:33,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821926115] [2020-08-18 18:39:33,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 18:39:33,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 18:39:33,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998860660] [2020-08-18 18:39:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 18:39:33,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 18:39:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 18:39:33,716 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 18:39:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:33,779 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 18:39:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 18:39:33,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 18:39:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:33,781 INFO L225 Difference]: With dead ends: 27 [2020-08-18 18:39:33,781 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 18:39:33,783 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 18:39:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 18:39:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 18:39:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 18:39:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 18:39:33,791 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 18:39:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:33,791 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 18:39:33,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 18:39:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 18:39:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 18:39:33,793 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:33,794 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 18:39:33,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 18:39:33,794 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-18 18:39:33,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:33,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227425055] [2020-08-18 18:39:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 18:39:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:33,947 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 18:39:33,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227425055] [2020-08-18 18:39:33,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:33,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 18:39:33,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745777577] [2020-08-18 18:39:33,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 18:39:33,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 18:39:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 18:39:33,950 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-18 18:39:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:34,050 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 18:39:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 18:39:34,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-18 18:39:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:34,052 INFO L225 Difference]: With dead ends: 38 [2020-08-18 18:39:34,052 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 18:39:34,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-18 18:39:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 18:39:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 18:39:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 18:39:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 18:39:34,062 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 18:39:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:34,063 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 18:39:34,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 18:39:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 18:39:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 18:39:34,065 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:34,065 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 18:39:34,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 18:39:34,066 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-18 18:39:34,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:34,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481392441] [2020-08-18 18:39:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,215 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 18:39:34,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [481392441] [2020-08-18 18:39:34,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:34,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 18:39:34,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672057313] [2020-08-18 18:39:34,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 18:39:34,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:34,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 18:39:34,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 18:39:34,218 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 18:39:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:34,331 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 18:39:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 18:39:34,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 18:39:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:34,334 INFO L225 Difference]: With dead ends: 41 [2020-08-18 18:39:34,334 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 18:39:34,335 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 18:39:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 18:39:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 18:39:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 18:39:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 18:39:34,346 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 18:39:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:34,347 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 18:39:34,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 18:39:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 18:39:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 18:39:34,349 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:34,350 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 18:39:34,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 18:39:34,350 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-18 18:39:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:34,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1946076397] [2020-08-18 18:39:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,497 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 18:39:34,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1946076397] [2020-08-18 18:39:34,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:34,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 18:39:34,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987604307] [2020-08-18 18:39:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 18:39:34,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 18:39:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-18 18:39:34,500 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-18 18:39:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:34,663 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-18 18:39:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 18:39:34,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-18 18:39:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:34,666 INFO L225 Difference]: With dead ends: 79 [2020-08-18 18:39:34,666 INFO L226 Difference]: Without dead ends: 48 [2020-08-18 18:39:34,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-18 18:39:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-18 18:39:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-18 18:39:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-18 18:39:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-18 18:39:34,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-18 18:39:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:34,681 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-18 18:39:34,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 18:39:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-18 18:39:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 18:39:34,683 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:34,683 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 18:39:34,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 18:39:34,684 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-18 18:39:34,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:34,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105247448] [2020-08-18 18:39:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,800 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 18:39:34,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105247448] [2020-08-18 18:39:34,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:34,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 18:39:34,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705876549] [2020-08-18 18:39:34,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 18:39:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 18:39:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 18:39:34,802 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-18 18:39:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:34,912 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-18 18:39:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 18:39:34,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 18:39:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:34,915 INFO L225 Difference]: With dead ends: 65 [2020-08-18 18:39:34,915 INFO L226 Difference]: Without dead ends: 61 [2020-08-18 18:39:34,916 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 18:39:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-18 18:39:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-18 18:39:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-18 18:39:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-18 18:39:34,931 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-18 18:39:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:34,932 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-18 18:39:34,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 18:39:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-18 18:39:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-18 18:39:34,936 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:34,936 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:34,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 18:39:34,936 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-18 18:39:34,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:34,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670151901] [2020-08-18 18:39:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:34,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-08-18 18:39:35,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670151901] [2020-08-18 18:39:35,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:35,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 18:39:35,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771669672] [2020-08-18 18:39:35,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 18:39:35,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 18:39:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-18 18:39:35,211 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-18 18:39:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:35,576 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-18 18:39:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-18 18:39:35,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-18 18:39:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:35,582 INFO L225 Difference]: With dead ends: 107 [2020-08-18 18:39:35,582 INFO L226 Difference]: Without dead ends: 57 [2020-08-18 18:39:35,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-08-18 18:39:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-18 18:39:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-18 18:39:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-18 18:39:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-18 18:39:35,612 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-18 18:39:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:35,612 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-18 18:39:35,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 18:39:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-18 18:39:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-18 18:39:35,620 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:35,620 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:35,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 18:39:35,623 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-18 18:39:35,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:35,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1792806095] [2020-08-18 18:39:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:35,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-08-18 18:39:36,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1792806095] [2020-08-18 18:39:36,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:36,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 18:39:36,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479260275] [2020-08-18 18:39:36,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 18:39:36,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 18:39:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-18 18:39:36,040 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-18 18:39:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:36,519 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-18 18:39:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-18 18:39:36,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-18 18:39:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:36,522 INFO L225 Difference]: With dead ends: 115 [2020-08-18 18:39:36,522 INFO L226 Difference]: Without dead ends: 74 [2020-08-18 18:39:36,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-18 18:39:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-18 18:39:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-18 18:39:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-18 18:39:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-18 18:39:36,547 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-18 18:39:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:36,549 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-18 18:39:36,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 18:39:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-18 18:39:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 18:39:36,555 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:36,561 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 18:39:36,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 18:39:36,562 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-18 18:39:36,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:36,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479557952] [2020-08-18 18:39:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:36,945 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 18:39:36,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479557952] [2020-08-18 18:39:36,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:36,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 18:39:36,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090723277] [2020-08-18 18:39:36,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 18:39:36,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 18:39:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 18:39:36,949 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-18 18:39:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:37,188 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-18 18:39:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 18:39:37,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 18:39:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:37,192 INFO L225 Difference]: With dead ends: 186 [2020-08-18 18:39:37,192 INFO L226 Difference]: Without dead ends: 182 [2020-08-18 18:39:37,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 18:39:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-18 18:39:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-18 18:39:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-18 18:39:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-18 18:39:37,218 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-18 18:39:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:37,218 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-18 18:39:37,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 18:39:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-18 18:39:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-18 18:39:37,223 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:37,223 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:37,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 18:39:37,223 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-18 18:39:37,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:37,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497222360] [2020-08-18 18:39:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:37,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-08-18 18:39:38,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497222360] [2020-08-18 18:39:38,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-18 18:39:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279515550] [2020-08-18 18:39:38,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-18 18:39:38,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-18 18:39:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-18 18:39:38,387 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-18 18:39:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:39,229 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-18 18:39:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-18 18:39:39,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-18 18:39:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:39,235 INFO L225 Difference]: With dead ends: 281 [2020-08-18 18:39:39,236 INFO L226 Difference]: Without dead ends: 125 [2020-08-18 18:39:39,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-18 18:39:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-18 18:39:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-18 18:39:39,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-18 18:39:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-18 18:39:39,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-18 18:39:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:39,265 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-18 18:39:39,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-18 18:39:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-18 18:39:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-18 18:39:39,280 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:39,280 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:39,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 18:39:39,281 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-18 18:39:39,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:39,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655615809] [2020-08-18 18:39:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:39,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:39,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:39,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:39,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:39,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 18:39:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:40,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-18 18:39:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-08-18 18:39:41,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655615809] [2020-08-18 18:39:41,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:41,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-18 18:39:41,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086300681] [2020-08-18 18:39:41,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-18 18:39:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-18 18:39:41,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-18 18:39:41,493 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-18 18:39:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:42,427 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-18 18:39:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-18 18:39:42,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-18 18:39:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:42,431 INFO L225 Difference]: With dead ends: 226 [2020-08-18 18:39:42,431 INFO L226 Difference]: Without dead ends: 136 [2020-08-18 18:39:42,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-18 18:39:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-18 18:39:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-18 18:39:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-18 18:39:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-18 18:39:42,447 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-18 18:39:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:42,448 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-18 18:39:42,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-18 18:39:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-18 18:39:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-18 18:39:42,467 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:42,468 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:42,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 18:39:42,468 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-18 18:39:42,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:42,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188373829] [2020-08-18 18:39:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:42,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 18:39:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:42,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 18:39:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:43,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:43,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 18:39:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-18 18:39:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 18:39:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 18:39:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 18:39:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 18:39:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 18:39:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 18:39:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:44,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 18:39:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 18:39:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-08-18 18:39:45,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188373829] [2020-08-18 18:39:45,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 18:39:45,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 18:39:45,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472344982] [2020-08-18 18:39:45,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 18:39:45,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 18:39:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 18:39:45,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-18 18:39:45,326 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-18 18:39:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 18:39:45,694 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-18 18:39:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-18 18:39:45,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-18 18:39:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 18:39:45,709 INFO L225 Difference]: With dead ends: 486 [2020-08-18 18:39:45,710 INFO L226 Difference]: Without dead ends: 482 [2020-08-18 18:39:45,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-18 18:39:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-18 18:39:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-18 18:39:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-18 18:39:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-18 18:39:45,786 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-18 18:39:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 18:39:45,787 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-18 18:39:45,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 18:39:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-18 18:39:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-18 18:39:45,854 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 18:39:45,855 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 18:39:45,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 18:39:45,855 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 18:39:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 18:39:45,856 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-18 18:39:45,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 18:39:45,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077283880] [2020-08-18 18:39:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 18:39:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 18:39:46,512 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 18:39:46,512 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 18:39:46,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 18:39:46,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 06:39:46 BoogieIcfgContainer [2020-08-18 18:39:46,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 18:39:46,612 INFO L168 Benchmark]: Toolchain (without parser) took 14281.15 ms. Allocated memory was 138.4 MB in the beginning and 812.1 MB in the end (delta: 673.7 MB). Free memory was 101.3 MB in the beginning and 250.7 MB in the end (delta: -149.4 MB). Peak memory consumption was 693.3 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:46,613 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 18:39:46,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.34 ms. Allocated memory is still 138.4 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:46,617 INFO L168 Benchmark]: Boogie Preprocessor took 23.03 ms. Allocated memory is still 138.4 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:46,618 INFO L168 Benchmark]: RCFGBuilder took 321.84 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 90.4 MB in the beginning and 167.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:46,622 INFO L168 Benchmark]: TraceAbstraction took 13713.85 ms. Allocated memory was 200.8 MB in the beginning and 812.1 MB in the end (delta: 611.3 MB). Free memory was 167.9 MB in the beginning and 250.7 MB in the end (delta: -82.8 MB). Peak memory consumption was 697.5 MB. Max. memory is 7.1 GB. [2020-08-18 18:39:46,625 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 138.4 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 214.34 ms. Allocated memory is still 138.4 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.03 ms. Allocated memory is still 138.4 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 321.84 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 90.4 MB in the beginning and 167.9 MB in the end (delta: -77.5 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13713.85 ms. Allocated memory was 200.8 MB in the beginning and 812.1 MB in the end (delta: 611.3 MB). Free memory was 167.9 MB in the beginning and 250.7 MB in the end (delta: -82.8 MB). Peak memory consumption was 697.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.5s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1806 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, 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, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 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...