/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:16:44,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:16:44,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:16:44,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:16:44,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:16:44,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:16:44,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:16:44,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:16:44,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:16:44,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:16:44,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:16:44,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:16:44,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:16:44,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:16:44,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:16:44,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:16:44,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:16:44,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:16:44,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:16:44,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:16:44,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:16:44,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:16:44,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:16:44,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:16:44,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:16:44,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:16:44,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:16:44,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:16:44,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:16:44,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:16:44,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:16:44,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:16:44,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:16:44,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:16:44,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:16:44,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:16:44,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:16:44,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:16:44,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:16:44,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:16:44,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:16:44,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:16:44,829 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:16:44,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:16:44,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:16:44,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:16:44,831 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:16:44,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:16:44,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:16:44,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:16:44,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:16:44,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:16:44,833 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:16:44,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:16:44,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:16:44,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:16:44,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:16:44,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:16:44,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:16:44,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:16:44,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:16:44,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:16:44,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:16:44,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:16:44,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:16:44,836 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:16:44,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:16:45,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:16:45,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:16:45,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:16:45,276 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:16:45,276 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:16:45,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-11-06 22:16:45,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a074e5c9d/7cdb5d4e00e24fda91b976b768267d7f/FLAGbaf2e3cba [2020-11-06 22:16:45,974 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:16:45,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-11-06 22:16:45,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a074e5c9d/7cdb5d4e00e24fda91b976b768267d7f/FLAGbaf2e3cba [2020-11-06 22:16:46,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a074e5c9d/7cdb5d4e00e24fda91b976b768267d7f [2020-11-06 22:16:46,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:16:46,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:16:46,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:16:46,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:16:46,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:16:46,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe6ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46, skipping insertion in model container [2020-11-06 22:16:46,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:16:46,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:16:46,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:16:46,562 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:16:46,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:16:46,601 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:16:46,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46 WrapperNode [2020-11-06 22:16:46,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:16:46,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:16:46,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:16:46,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:16:46,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... [2020-11-06 22:16:46,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:16:46,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:16:46,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:16:46,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:16:46,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:16:46,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:16:46,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:16:46,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:16:46,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-11-06 22:16:46,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-11-06 22:16:46,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:16:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:16:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:16:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:16:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:16:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:16:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:16:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:16:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:16:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:16:47,154 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:16:47,154 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:16:47,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:47 BoogieIcfgContainer [2020-11-06 22:16:47,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:16:47,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:16:47,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:16:47,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:16:47,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:16:46" (1/3) ... [2020-11-06 22:16:47,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46584ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:47, skipping insertion in model container [2020-11-06 22:16:47,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:46" (2/3) ... [2020-11-06 22:16:47,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46584ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:47, skipping insertion in model container [2020-11-06 22:16:47,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:47" (3/3) ... [2020-11-06 22:16:47,167 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-11-06 22:16:47,185 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:16:47,189 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:16:47,206 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:16:47,241 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:16:47,241 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:16:47,241 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:16:47,242 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:16:47,242 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:16:47,242 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:16:47,242 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:16:47,242 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:16:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-11-06 22:16:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-06 22:16:47,271 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:47,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:47,273 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 219823047, now seen corresponding path program 1 times [2020-11-06 22:16:47,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:47,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018047834] [2020-11-06 22:16:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:47,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:47,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:16:47,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018047834] [2020-11-06 22:16:47,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:16:47,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:16:47,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811491778] [2020-11-06 22:16:47,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:16:47,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:16:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:16:47,863 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2020-11-06 22:16:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:48,346 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2020-11-06 22:16:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:16:48,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-06 22:16:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:48,366 INFO L225 Difference]: With dead ends: 53 [2020-11-06 22:16:48,366 INFO L226 Difference]: Without dead ends: 32 [2020-11-06 22:16:48,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:16:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-06 22:16:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-06 22:16:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-06 22:16:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-11-06 22:16:48,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2020-11-06 22:16:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:48,443 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-11-06 22:16:48,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:16:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-11-06 22:16:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-06 22:16:48,446 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:48,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:48,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:16:48,447 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1220716726, now seen corresponding path program 1 times [2020-11-06 22:16:48,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:48,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360565895] [2020-11-06 22:16:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:48,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:48,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:16:48,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360565895] [2020-11-06 22:16:48,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:16:48,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:16:48,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498054453] [2020-11-06 22:16:48,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:16:48,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:16:48,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:16:48,572 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 6 states. [2020-11-06 22:16:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:48,884 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2020-11-06 22:16:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:16:48,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-06 22:16:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:48,887 INFO L225 Difference]: With dead ends: 39 [2020-11-06 22:16:48,887 INFO L226 Difference]: Without dead ends: 34 [2020-11-06 22:16:48,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:16:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-06 22:16:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-11-06 22:16:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-06 22:16:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-11-06 22:16:48,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 16 [2020-11-06 22:16:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:48,903 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-11-06 22:16:48,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:16:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-11-06 22:16:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:16:48,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:48,905 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:48,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:16:48,905 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2083135015, now seen corresponding path program 1 times [2020-11-06 22:16:48,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:48,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101809870] [2020-11-06 22:16:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:48,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:48,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:49,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:49,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:16:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:16:49,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101809870] [2020-11-06 22:16:49,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585025644] [2020-11-06 22:16:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:49,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:16:49,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:16:49,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:49,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-11-06 22:16:49,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018261561] [2020-11-06 22:16:49,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:16:49,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:16:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:16:49,349 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 11 states. [2020-11-06 22:16:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:49,968 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2020-11-06 22:16:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:16:49,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-11-06 22:16:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:49,970 INFO L225 Difference]: With dead ends: 61 [2020-11-06 22:16:49,971 INFO L226 Difference]: Without dead ends: 36 [2020-11-06 22:16:49,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:16:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-06 22:16:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-11-06 22:16:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-06 22:16:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-11-06 22:16:49,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 28 [2020-11-06 22:16:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:49,983 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-11-06 22:16:49,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:16:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2020-11-06 22:16:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:16:49,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:49,985 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:50,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:16:50,201 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 752879968, now seen corresponding path program 1 times [2020-11-06 22:16:50,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:50,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972114099] [2020-11-06 22:16:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:16:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:16:50,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972114099] [2020-11-06 22:16:50,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434084253] [2020-11-06 22:16:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:50,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:16:50,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:16:50,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:50,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-11-06 22:16:50,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713911176] [2020-11-06 22:16:50,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:16:50,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:16:50,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:16:50,527 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 10 states. [2020-11-06 22:16:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:51,191 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2020-11-06 22:16:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:16:51,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-11-06 22:16:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:51,196 INFO L225 Difference]: With dead ends: 57 [2020-11-06 22:16:51,199 INFO L226 Difference]: Without dead ends: 52 [2020-11-06 22:16:51,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:16:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-06 22:16:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2020-11-06 22:16:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-06 22:16:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2020-11-06 22:16:51,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 29 [2020-11-06 22:16:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:51,234 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2020-11-06 22:16:51,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:16:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2020-11-06 22:16:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-06 22:16:51,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:51,237 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:51,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:51,438 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2070859795, now seen corresponding path program 1 times [2020-11-06 22:16:51,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:51,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79614533] [2020-11-06 22:16:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:16:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:16:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:16:51,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79614533] [2020-11-06 22:16:51,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262491966] [2020-11-06 22:16:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:51,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:16:51,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:16:51,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:51,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-11-06 22:16:51,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102626989] [2020-11-06 22:16:51,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:16:51,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:16:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:16:51,805 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand 12 states. [2020-11-06 22:16:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:52,814 INFO L93 Difference]: Finished difference Result 111 states and 173 transitions. [2020-11-06 22:16:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:16:52,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-11-06 22:16:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:52,818 INFO L225 Difference]: With dead ends: 111 [2020-11-06 22:16:52,818 INFO L226 Difference]: Without dead ends: 68 [2020-11-06 22:16:52,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:16:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-06 22:16:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-11-06 22:16:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-06 22:16:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2020-11-06 22:16:52,840 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 41 [2020-11-06 22:16:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:52,841 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2020-11-06 22:16:52,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:16:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2020-11-06 22:16:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-06 22:16:52,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:52,844 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:53,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:53,058 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1960607334, now seen corresponding path program 1 times [2020-11-06 22:16:53,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:53,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895726127] [2020-11-06 22:16:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:16:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:16:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-06 22:16:53,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895726127] [2020-11-06 22:16:53,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027422561] [2020-11-06 22:16:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:53,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:16:53,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:16:53,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:53,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-11-06 22:16:53,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346023040] [2020-11-06 22:16:53,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:16:53,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:53,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:16:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:16:53,509 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand 14 states. [2020-11-06 22:16:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:54,900 INFO L93 Difference]: Finished difference Result 183 states and 327 transitions. [2020-11-06 22:16:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:16:54,901 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-11-06 22:16:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:54,905 INFO L225 Difference]: With dead ends: 183 [2020-11-06 22:16:54,905 INFO L226 Difference]: Without dead ends: 122 [2020-11-06 22:16:54,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2020-11-06 22:16:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-06 22:16:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2020-11-06 22:16:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-06 22:16:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2020-11-06 22:16:54,953 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 42 [2020-11-06 22:16:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:54,954 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2020-11-06 22:16:54,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:16:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2020-11-06 22:16:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-06 22:16:54,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:54,962 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:55,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:55,164 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -751460799, now seen corresponding path program 1 times [2020-11-06 22:16:55,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:55,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583315393] [2020-11-06 22:16:55,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:16:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:16:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-06 22:16:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-11-06 22:16:55,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583315393] [2020-11-06 22:16:55,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882475752] [2020-11-06 22:16:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:55,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-06 22:16:55,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-06 22:16:55,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:55,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-11-06 22:16:55,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487222386] [2020-11-06 22:16:55,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-06 22:16:55,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-06 22:16:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:16:55,637 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand 15 states. [2020-11-06 22:16:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:16:57,304 INFO L93 Difference]: Finished difference Result 261 states and 501 transitions. [2020-11-06 22:16:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-06 22:16:57,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-11-06 22:16:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:16:57,308 INFO L225 Difference]: With dead ends: 261 [2020-11-06 22:16:57,309 INFO L226 Difference]: Without dead ends: 160 [2020-11-06 22:16:57,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2020-11-06 22:16:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-06 22:16:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 114. [2020-11-06 22:16:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-06 22:16:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 182 transitions. [2020-11-06 22:16:57,349 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 182 transitions. Word has length 56 [2020-11-06 22:16:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:16:57,350 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 182 transitions. [2020-11-06 22:16:57,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-06 22:16:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 182 transitions. [2020-11-06 22:16:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-06 22:16:57,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:16:57,363 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:16:57,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:16:57,580 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:16:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:16:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2107233529, now seen corresponding path program 1 times [2020-11-06 22:16:57,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:16:57,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132958120] [2020-11-06 22:16:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:16:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:16:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:16:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:16:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:16:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:16:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:16:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:16:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:16:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:16:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:16:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-11-06 22:16:57,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132958120] [2020-11-06 22:16:57,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737193361] [2020-11-06 22:16:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:16:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:16:58,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-06 22:16:58,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:16:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-11-06 22:16:58,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:16:58,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-11-06 22:16:58,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247739401] [2020-11-06 22:16:58,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-06 22:16:58,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:16:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-06 22:16:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:16:58,273 INFO L87 Difference]: Start difference. First operand 114 states and 182 transitions. Second operand 17 states. [2020-11-06 22:17:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:17:00,320 INFO L93 Difference]: Finished difference Result 246 states and 468 transitions. [2020-11-06 22:17:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-06 22:17:00,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2020-11-06 22:17:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:17:00,323 INFO L225 Difference]: With dead ends: 246 [2020-11-06 22:17:00,323 INFO L226 Difference]: Without dead ends: 112 [2020-11-06 22:17:00,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2020-11-06 22:17:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-06 22:17:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2020-11-06 22:17:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-06 22:17:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-11-06 22:17:00,351 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 112 [2020-11-06 22:17:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:17:00,354 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-11-06 22:17:00,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-06 22:17:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-11-06 22:17:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2020-11-06 22:17:00,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:17:00,360 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 12, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:17:00,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:00,576 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:17:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:17:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1050683425, now seen corresponding path program 1 times [2020-11-06 22:17:00,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:17:00,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11369905] [2020-11-06 22:17:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:17:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:17:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:17:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:17:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-06 22:17:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:00,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:17:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 67 proven. 173 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2020-11-06 22:17:01,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11369905] [2020-11-06 22:17:01,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747471542] [2020-11-06 22:17:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:01,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-06 22:17:01,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:17:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 54 proven. 153 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2020-11-06 22:17:01,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:17:01,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2020-11-06 22:17:01,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192785722] [2020-11-06 22:17:01,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:17:01,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:17:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:17:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:17:01,338 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 16 states. [2020-11-06 22:17:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:17:03,051 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2020-11-06 22:17:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-06 22:17:03,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 168 [2020-11-06 22:17:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:17:03,054 INFO L225 Difference]: With dead ends: 175 [2020-11-06 22:17:03,055 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:17:03,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:17:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:17:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2020-11-06 22:17:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-06 22:17:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2020-11-06 22:17:03,072 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 168 [2020-11-06 22:17:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:17:03,073 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2020-11-06 22:17:03,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:17:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2020-11-06 22:17:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-06 22:17:03,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:17:03,075 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:17:03,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:03,290 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:17:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:17:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash -737203870, now seen corresponding path program 1 times [2020-11-06 22:17:03,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:17:03,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744753469] [2020-11-06 22:17:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:17:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:17:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:17:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:17:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:17:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-11-06 22:17:03,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744753469] [2020-11-06 22:17:03,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507091957] [2020-11-06 22:17:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:03,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-06 22:17:03,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:17:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2020-11-06 22:17:04,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:17:04,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 18 [2020-11-06 22:17:04,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069064807] [2020-11-06 22:17:04,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:17:04,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:17:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:17:04,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:17:04,005 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand 18 states. [2020-11-06 22:17:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:17:06,123 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2020-11-06 22:17:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-06 22:17:06,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 152 [2020-11-06 22:17:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:17:06,126 INFO L225 Difference]: With dead ends: 198 [2020-11-06 22:17:06,126 INFO L226 Difference]: Without dead ends: 115 [2020-11-06 22:17:06,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2020-11-06 22:17:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-06 22:17:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2020-11-06 22:17:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-06 22:17:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2020-11-06 22:17:06,143 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 152 [2020-11-06 22:17:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:17:06,144 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2020-11-06 22:17:06,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:17:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2020-11-06 22:17:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-11-06 22:17:06,148 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:17:06,148 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 18, 18, 14, 12, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:17:06,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-06 22:17:06,362 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:17:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:17:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1141243885, now seen corresponding path program 2 times [2020-11-06 22:17:06,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:17:06,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382951369] [2020-11-06 22:17:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:17:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:17:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:17:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-06 22:17:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-06 22:17:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-06 22:17:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:06,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 159 proven. 563 refuted. 0 times theorem prover too weak. 1355 trivial. 0 not checked. [2020-11-06 22:17:07,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382951369] [2020-11-06 22:17:07,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852203580] [2020-11-06 22:17:07,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:07,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:17:07,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:17:07,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-06 22:17:07,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:17:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2077 backedges. 114 proven. 358 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2020-11-06 22:17:07,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:17:07,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2020-11-06 22:17:07,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452843771] [2020-11-06 22:17:07,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-06 22:17:07,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:17:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-06 22:17:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:17:07,436 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 21 states. [2020-11-06 22:17:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:17:10,350 INFO L93 Difference]: Finished difference Result 260 states and 424 transitions. [2020-11-06 22:17:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-06 22:17:10,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 278 [2020-11-06 22:17:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:17:10,353 INFO L225 Difference]: With dead ends: 260 [2020-11-06 22:17:10,354 INFO L226 Difference]: Without dead ends: 129 [2020-11-06 22:17:10,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=2096, Unknown=0, NotChecked=0, Total=2450 [2020-11-06 22:17:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-06 22:17:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2020-11-06 22:17:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-06 22:17:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2020-11-06 22:17:10,378 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 278 [2020-11-06 22:17:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:17:10,379 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2020-11-06 22:17:10,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-06 22:17:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2020-11-06 22:17:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-06 22:17:10,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:17:10,383 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:17:10,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:10,597 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:17:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:17:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2086345789, now seen corresponding path program 2 times [2020-11-06 22:17:10,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:17:10,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890829795] [2020-11-06 22:17:10,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:17:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:17:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:17:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:17:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:10,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:17:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:17:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:17:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:17:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:17:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:17:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:17:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 207 proven. 371 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2020-11-06 22:17:11,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890829795] [2020-11-06 22:17:11,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506411216] [2020-11-06 22:17:11,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:11,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:17:11,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:17:11,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-06 22:17:11,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:17:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 275 proven. 129 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2020-11-06 22:17:11,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:17:11,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2020-11-06 22:17:11,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300871752] [2020-11-06 22:17:11,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-06 22:17:11,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:17:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-06 22:17:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:17:11,608 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 21 states. [2020-11-06 22:17:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:17:14,607 INFO L93 Difference]: Finished difference Result 239 states and 302 transitions. [2020-11-06 22:17:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-06 22:17:14,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 220 [2020-11-06 22:17:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:17:14,615 INFO L225 Difference]: With dead ends: 239 [2020-11-06 22:17:14,615 INFO L226 Difference]: Without dead ends: 145 [2020-11-06 22:17:14,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=418, Invalid=2552, Unknown=0, NotChecked=0, Total=2970 [2020-11-06 22:17:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-06 22:17:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2020-11-06 22:17:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-06 22:17:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2020-11-06 22:17:14,633 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 220 [2020-11-06 22:17:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:17:14,633 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-11-06 22:17:14,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-06 22:17:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2020-11-06 22:17:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-06 22:17:14,636 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:17:14,636 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:17:14,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:17:14,851 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:17:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:17:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash -695303513, now seen corresponding path program 3 times [2020-11-06 22:17:14,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:17:14,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981510934] [2020-11-06 22:17:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:17:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:17:14,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:17:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:17:14,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:17:14,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:17:14,964 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:17:14,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:17:15,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:15 BoogieIcfgContainer [2020-11-06 22:17:15,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:17:15,121 INFO L168 Benchmark]: Toolchain (without parser) took 28811.74 ms. Allocated memory was 165.7 MB in the beginning and 418.4 MB in the end (delta: 252.7 MB). Free memory was 122.0 MB in the beginning and 302.2 MB in the end (delta: -180.2 MB). Peak memory consumption was 74.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:17:15,122 INFO L168 Benchmark]: CDTParser took 1.35 ms. Allocated memory is still 165.7 MB. Free memory is still 138.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:17:15,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.44 ms. Allocated memory is still 165.7 MB. Free memory was 121.4 MB in the beginning and 140.5 MB in the end (delta: -19.2 MB). Peak memory consumption was 5.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:17:15,133 INFO L168 Benchmark]: Boogie Preprocessor took 36.72 ms. Allocated memory is still 165.7 MB. Free memory was 140.5 MB in the beginning and 139.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:17:15,134 INFO L168 Benchmark]: RCFGBuilder took 514.88 ms. Allocated memory is still 165.7 MB. Free memory was 139.1 MB in the beginning and 135.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:17:15,135 INFO L168 Benchmark]: TraceAbstraction took 27959.34 ms. Allocated memory was 165.7 MB in the beginning and 418.4 MB in the end (delta: 252.7 MB). Free memory was 134.9 MB in the beginning and 302.2 MB in the end (delta: -167.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:17:15,146 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35 ms. Allocated memory is still 165.7 MB. Free memory is still 138.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 280.44 ms. Allocated memory is still 165.7 MB. Free memory was 121.4 MB in the beginning and 140.5 MB in the end (delta: -19.2 MB). Peak memory consumption was 5.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.72 ms. Allocated memory is still 165.7 MB. Free memory was 140.5 MB in the beginning and 139.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 514.88 ms. Allocated memory is still 165.7 MB. Free memory was 139.1 MB in the beginning and 135.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27959.34 ms. Allocated memory was 165.7 MB in the beginning and 418.4 MB in the end (delta: 252.7 MB). Free memory was 134.9 MB in the beginning and 302.2 MB in the end (delta: -167.3 MB). Peak memory consumption was 87.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] CALL reach_error() [L4] __assert_fail("0", "fibo_2calls_6-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.7s, OverallIterations: 13, TraceHistogramMax: 21, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 403 SDtfs, 937 SDslu, 1135 SDs, 0 SdLazy, 5900 SolverSat, 1031 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 1441 SyntacticMatches, 2 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred 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, 157 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2462 NumberOfCodeBlocks, 2462 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2261 ConstructedInterpolants, 0 QuantifiedInterpolants, 599861 SizeOfPredicates, 48 NumberOfNonLiveVariables, 3135 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 7714/9896 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...