/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 10:59:43,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 10:59:43,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 10:59:43,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 10:59:43,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 10:59:43,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 10:59:43,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 10:59:43,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 10:59:43,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 10:59:43,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 10:59:43,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 10:59:43,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 10:59:43,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 10:59:43,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 10:59:43,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 10:59:43,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 10:59:43,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 10:59:43,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 10:59:43,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 10:59:43,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 10:59:43,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 10:59:43,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 10:59:43,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 10:59:43,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 10:59:43,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 10:59:43,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 10:59:43,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 10:59:43,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 10:59:43,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 10:59:43,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 10:59:43,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 10:59:43,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 10:59:43,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 10:59:43,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 10:59:43,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 10:59:43,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 10:59:43,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 10:59:43,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 10:59:43,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 10:59:43,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 10:59:43,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 10:59:43,578 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-07-21 10:59:43,598 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 10:59:43,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 10:59:43,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 10:59:43,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 10:59:43,601 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 10:59:43,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 10:59:43,601 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 10:59:43,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 10:59:43,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 10:59:43,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 10:59:43,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 10:59:43,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 10:59:43,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 10:59:43,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 10:59:43,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 10:59:43,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 10:59:43,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 10:59:43,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 10:59:43,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 10:59:43,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 10:59:43,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 10:59:43,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:43,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 10:59:43,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 10:59:43,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 10:59:43,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 10:59:43,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 10:59:43,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 10:59:43,938 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 10:59:43,939 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 10:59:43,940 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-21 10:59:44,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b05f15b8/ed48d1d0163346ae9560cec49fa5cab8/FLAG0a139503f [2020-07-21 10:59:44,561 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 10:59:44,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-21 10:59:44,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b05f15b8/ed48d1d0163346ae9560cec49fa5cab8/FLAG0a139503f [2020-07-21 10:59:44,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b05f15b8/ed48d1d0163346ae9560cec49fa5cab8 [2020-07-21 10:59:44,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 10:59:44,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 10:59:44,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 10:59:44,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 10:59:44,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 10:59:44,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:59:44" (1/1) ... [2020-07-21 10:59:44,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a42054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:44, skipping insertion in model container [2020-07-21 10:59:44,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:59:44" (1/1) ... [2020-07-21 10:59:44,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 10:59:44,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 10:59:45,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:59:45,139 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 10:59:45,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 10:59:45,166 INFO L208 MainTranslator]: Completed translation [2020-07-21 10:59:45,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45 WrapperNode [2020-07-21 10:59:45,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 10:59:45,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 10:59:45,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 10:59:45,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 10:59:45,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (1/1) ... [2020-07-21 10:59:45,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 10:59:45,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 10:59:45,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 10:59:45,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 10:59:45,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (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-07-21 10:59:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 10:59:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 10:59:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 10:59:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 10:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 10:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 10:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 10:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 10:59:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 10:59:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 10:59:45,574 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 10:59:45,574 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 10:59:45,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:59:45 BoogieIcfgContainer [2020-07-21 10:59:45,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 10:59:45,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 10:59:45,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 10:59:45,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 10:59:45,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:59:44" (1/3) ... [2020-07-21 10:59:45,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fef767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:59:45, skipping insertion in model container [2020-07-21 10:59:45,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:59:45" (2/3) ... [2020-07-21 10:59:45,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fef767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:59:45, skipping insertion in model container [2020-07-21 10:59:45,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:59:45" (3/3) ... [2020-07-21 10:59:45,592 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-21 10:59:45,610 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 10:59:45,619 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 10:59:45,639 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 10:59:45,683 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 10:59:45,684 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 10:59:45,684 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 10:59:45,685 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 10:59:45,685 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 10:59:45,689 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 10:59:45,689 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 10:59:45,689 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 10:59:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 10:59:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 10:59:45,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:45,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:45,763 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 10:59:45,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:45,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272095333] [2020-07-21 10:59:45,785 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:45,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:59:45,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 10:59:45,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:59:45,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272095333] [2020-07-21 10:59:45,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:59:45,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:59:45,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129431923] [2020-07-21 10:59:45,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:59:45,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:45,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:59:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:59:45,990 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 10:59:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:46,125 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 10:59:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:59:46,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 10:59:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:46,142 INFO L225 Difference]: With dead ends: 35 [2020-07-21 10:59:46,142 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 10:59:46,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 10:59:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 10:59:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 10:59:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:59:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:59:46,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 10:59:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:46,208 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:59:46,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:59:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:59:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 10:59:46,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:46,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:46,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:46,428 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 10:59:46,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:46,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515403643] [2020-07-21 10:59:46,430 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:46,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 10:59:46,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 10:59:46,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 10:59:46,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515403643] [2020-07-21 10:59:46,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 10:59:46,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 10:59:46,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775969276] [2020-07-21 10:59:46,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 10:59:46,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 10:59:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 10:59:46,508 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 10:59:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:46,592 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 10:59:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 10:59:46,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 10:59:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:46,595 INFO L225 Difference]: With dead ends: 27 [2020-07-21 10:59:46,595 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 10:59:46,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 10:59:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 10:59:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 10:59:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 10:59:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 10:59:46,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 10:59:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:46,606 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 10:59:46,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 10:59:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 10:59:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 10:59:46,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:46,609 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:46,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:46,825 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 10:59:46,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:46,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958313902] [2020-07-21 10:59:46,829 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 10:59:46,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 10:59:46,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:47,119 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 10:59:47,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958313902] [2020-07-21 10:59:47,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:47,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 10:59:47,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759325639] [2020-07-21 10:59:47,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 10:59:47,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 10:59:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 10:59:47,200 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 10:59:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:47,354 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 10:59:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 10:59:47,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 10:59:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:47,357 INFO L225 Difference]: With dead ends: 32 [2020-07-21 10:59:47,357 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 10:59:47,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:59:47,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 10:59:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 10:59:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 10:59:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 10:59:47,368 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 10:59:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:47,369 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 10:59:47,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 10:59:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 10:59:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 10:59:47,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:47,371 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:47,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:47,582 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 10:59:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:47,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408944083] [2020-07-21 10:59:47,584 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:47,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 10:59:47,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 10:59:47,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:47,823 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 10:59:47,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408944083] [2020-07-21 10:59:47,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:47,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 10:59:47,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112539929] [2020-07-21 10:59:47,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 10:59:47,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:47,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 10:59:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 10:59:47,862 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 10:59:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:47,950 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 10:59:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 10:59:47,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 10:59:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:47,954 INFO L225 Difference]: With dead ends: 37 [2020-07-21 10:59:47,954 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 10:59:47,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:59:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 10:59:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 10:59:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 10:59:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 10:59:47,964 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 10:59:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:47,964 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 10:59:47,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 10:59:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 10:59:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 10:59:47,966 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:47,967 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:48,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:48,181 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 10:59:48,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:48,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739179637] [2020-07-21 10:59:48,182 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:48,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 10:59:48,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-21 10:59:48,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:48,521 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:48,524 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:48,589 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:48,591 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 10:59:48,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739179637] [2020-07-21 10:59:48,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:48,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 10:59:48,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448602054] [2020-07-21 10:59:48,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 10:59:48,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 10:59:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:59:48,656 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 10:59:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:48,828 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 10:59:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 10:59:48,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 10:59:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:48,832 INFO L225 Difference]: With dead ends: 42 [2020-07-21 10:59:48,832 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 10:59:48,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 10:59:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 10:59:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 10:59:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 10:59:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 10:59:48,843 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 10:59:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:48,843 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 10:59:48,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 10:59:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 10:59:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 10:59:48,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:48,846 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:49,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:49,053 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 10:59:49,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:49,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1213759989] [2020-07-21 10:59:49,055 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:49,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 10:59:49,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 10:59:49,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:49,391 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:49,444 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:49,445 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 10:59:49,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1213759989] [2020-07-21 10:59:49,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:49,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 10:59:49,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284376836] [2020-07-21 10:59:49,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 10:59:49,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:49,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 10:59:49,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 10:59:49,481 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 10:59:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:49,631 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 10:59:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 10:59:49,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 10:59:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:49,634 INFO L225 Difference]: With dead ends: 47 [2020-07-21 10:59:49,635 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 10:59:49,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 10:59:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 10:59:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 10:59:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 10:59:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 10:59:49,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 10:59:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:49,647 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 10:59:49,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 10:59:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 10:59:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 10:59:49,650 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:49,650 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:49,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:49,866 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 10:59:49,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:49,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107692553] [2020-07-21 10:59:49,869 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:49,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 10:59:49,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-21 10:59:49,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:50,397 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:50,486 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:50,487 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:50,534 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:50,535 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-21 10:59:50,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107692553] [2020-07-21 10:59:50,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:50,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 10:59:50,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123059037] [2020-07-21 10:59:50,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 10:59:50,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 10:59:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 10:59:50,593 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 10:59:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:50,794 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 10:59:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 10:59:50,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 10:59:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:50,797 INFO L225 Difference]: With dead ends: 52 [2020-07-21 10:59:50,797 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 10:59:50,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:59:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 10:59:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 10:59:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 10:59:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 10:59:50,831 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 10:59:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:50,834 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 10:59:50,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 10:59:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 10:59:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 10:59:50,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:50,841 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:51,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:51,042 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 10:59:51,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:51,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108833193] [2020-07-21 10:59:51,045 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:51,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 10:59:51,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-21 10:59:51,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:51,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:51,764 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:51,765 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:51,807 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-21 10:59:51,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108833193] [2020-07-21 10:59:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 10:59:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671789248] [2020-07-21 10:59:51,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 10:59:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 10:59:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 10:59:51,852 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-21 10:59:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:52,009 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-21 10:59:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 10:59:52,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-21 10:59:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:52,014 INFO L225 Difference]: With dead ends: 57 [2020-07-21 10:59:52,014 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 10:59:52,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:59:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 10:59:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-21 10:59:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 10:59:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 10:59:52,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-21 10:59:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:52,029 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 10:59:52,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 10:59:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 10:59:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-21 10:59:52,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:52,032 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:52,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:52,246 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-21 10:59:52,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:52,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21805452] [2020-07-21 10:59:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:52,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 10:59:52,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-21 10:59:52,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:53,045 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:53,047 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:53,238 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:53,339 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:53,395 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-21 10:59:53,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21805452] [2020-07-21 10:59:53,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:53,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 10:59:53,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425026204] [2020-07-21 10:59:53,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 10:59:53,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:53,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 10:59:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 10:59:53,452 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-21 10:59:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:53,740 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-21 10:59:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 10:59:53,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-21 10:59:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:53,744 INFO L225 Difference]: With dead ends: 62 [2020-07-21 10:59:53,744 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 10:59:53,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 10:59:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 10:59:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-21 10:59:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 10:59:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 10:59:53,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-21 10:59:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:53,758 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 10:59:53,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 10:59:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 10:59:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 10:59:53,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:53,762 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:53,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:53,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-21 10:59:53,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:53,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512530102] [2020-07-21 10:59:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:54,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 10:59:54,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-21 10:59:54,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:54,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,180 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,268 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,269 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,320 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,321 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-21 10:59:55,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512530102] [2020-07-21 10:59:55,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:55,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 10:59:55,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289973333] [2020-07-21 10:59:55,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 10:59:55,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 10:59:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 10:59:55,405 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-21 10:59:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:55,584 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-21 10:59:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 10:59:55,585 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-21 10:59:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:55,588 INFO L225 Difference]: With dead ends: 67 [2020-07-21 10:59:55,588 INFO L226 Difference]: Without dead ends: 63 [2020-07-21 10:59:55,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 10:59:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-21 10:59:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-21 10:59:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 10:59:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 10:59:55,602 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-21 10:59:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:55,603 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 10:59:55,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 10:59:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 10:59:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 10:59:55,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:55,608 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:55,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:55,824 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-21 10:59:55,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:55,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093827219] [2020-07-21 10:59:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:55,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:59:55,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-21 10:59:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 10:59:57,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,591 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,737 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,817 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,872 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,873 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 10:59:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-21 10:59:57,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093827219] [2020-07-21 10:59:57,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 10:59:57,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 10:59:57,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940943062] [2020-07-21 10:59:57,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 10:59:57,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 10:59:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 10:59:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 10:59:57,980 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-21 10:59:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 10:59:58,221 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-21 10:59:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 10:59:58,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-21 10:59:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 10:59:58,226 INFO L225 Difference]: With dead ends: 72 [2020-07-21 10:59:58,226 INFO L226 Difference]: Without dead ends: 68 [2020-07-21 10:59:58,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 10:59:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-21 10:59:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-21 10:59:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 10:59:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 10:59:58,260 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-21 10:59:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 10:59:58,262 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 10:59:58,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 10:59:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 10:59:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-21 10:59:58,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 10:59:58,272 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 10:59:58,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:58,487 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 10:59:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 10:59:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-21 10:59:58,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 10:59:58,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2045854182] [2020-07-21 10:59:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 10:59:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 10:59:58,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 10:59:58,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 10:59:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1055 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2020-07-21 10:59:58,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:00,002 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,330 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,505 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,593 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,594 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,641 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1095 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2020-07-21 11:00:00,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2045854182] [2020-07-21 11:00:00,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:00,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 16 [2020-07-21 11:00:00,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237114083] [2020-07-21 11:00:00,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 11:00:00,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 11:00:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-07-21 11:00:00,749 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 16 states. [2020-07-21 11:00:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:00,981 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-21 11:00:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 11:00:00,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 299 [2020-07-21 11:00:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:00,991 INFO L225 Difference]: With dead ends: 77 [2020-07-21 11:00:00,991 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 11:00:00,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 570 SyntacticMatches, 13 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-07-21 11:00:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 11:00:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-21 11:00:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 11:00:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 11:00:01,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-21 11:00:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:01,025 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 11:00:01,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 11:00:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 11:00:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-21 11:00:01,039 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:01,039 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:01,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:01,254 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-21 11:00:01,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:01,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412442649] [2020-07-21 11:00:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:00:01,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 11:00:01,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:00:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2126 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2020-07-21 11:00:01,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:03,675 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,190 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,541 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,756 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,839 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,887 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:04,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2177 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2020-07-21 11:00:05,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412442649] [2020-07-21 11:00:05,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:05,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-21 11:00:05,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514150714] [2020-07-21 11:00:05,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 11:00:05,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:05,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 11:00:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-21 11:00:05,098 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 18 states. [2020-07-21 11:00:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:05,588 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-21 11:00:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:00:05,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 507 [2020-07-21 11:00:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:05,593 INFO L225 Difference]: With dead ends: 82 [2020-07-21 11:00:05,594 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 11:00:05,595 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 983 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-21 11:00:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 11:00:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-21 11:00:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 11:00:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 11:00:05,610 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-21 11:00:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:05,611 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 11:00:05,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 11:00:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 11:00:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-21 11:00:05,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:05,616 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:05,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:05,829 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-21 11:00:05,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:05,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211138067] [2020-07-21 11:00:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:00:06,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 11:00:06,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:00:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 648 proven. 1709 refuted. 0 times theorem prover too weak. 9325 trivial. 0 not checked. [2020-07-21 11:00:06,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:08,134 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:08,136 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:08,729 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:08,730 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:08,968 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,232 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,284 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,350 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 652 proven. 1756 refuted. 0 times theorem prover too weak. 9274 trivial. 0 not checked. [2020-07-21 11:00:09,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211138067] [2020-07-21 11:00:09,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:09,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-21 11:00:09,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145250387] [2020-07-21 11:00:09,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 11:00:09,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 11:00:09,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-21 11:00:09,562 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 18 states. [2020-07-21 11:00:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:09,894 INFO L93 Difference]: Finished difference Result 147 states and 749 transitions. [2020-07-21 11:00:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:00:09,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 450 [2020-07-21 11:00:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:09,898 INFO L225 Difference]: With dead ends: 147 [2020-07-21 11:00:09,899 INFO L226 Difference]: Without dead ends: 70 [2020-07-21 11:00:09,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-21 11:00:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-21 11:00:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-21 11:00:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-21 11:00:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2020-07-21 11:00:09,933 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 450 [2020-07-21 11:00:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:09,935 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2020-07-21 11:00:09,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 11:00:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2020-07-21 11:00:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-07-21 11:00:09,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:09,940 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:10,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:10,155 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-07-21 11:00:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:10,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159125471] [2020-07-21 11:00:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:00:10,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 11:00:10,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:00:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 467 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2020-07-21 11:00:10,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:12,049 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,442 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,723 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,889 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:12,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:13,020 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:13,021 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:13,130 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 518 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2020-07-21 11:00:13,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159125471] [2020-07-21 11:00:13,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:13,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-21 11:00:13,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11105435] [2020-07-21 11:00:13,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 11:00:13,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 11:00:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-21 11:00:13,424 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 18 states. [2020-07-21 11:00:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:13,759 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-07-21 11:00:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:00:13,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 327 [2020-07-21 11:00:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:13,765 INFO L225 Difference]: With dead ends: 120 [2020-07-21 11:00:13,765 INFO L226 Difference]: Without dead ends: 108 [2020-07-21 11:00:13,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 622 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-21 11:00:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-21 11:00:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2020-07-21 11:00:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-21 11:00:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 167 transitions. [2020-07-21 11:00:13,786 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 167 transitions. Word has length 327 [2020-07-21 11:00:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:13,787 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 167 transitions. [2020-07-21 11:00:13,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 11:00:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 167 transitions. [2020-07-21 11:00:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2020-07-21 11:00:13,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:13,794 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 34, 20, 20, 20, 20, 20, 20, 20, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:14,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:14,008 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash -301446619, now seen corresponding path program 8 times [2020-07-21 11:00:14,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:14,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173659490] [2020-07-21 11:00:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:00:14,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 11:00:14,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:00:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 494 proven. 483 refuted. 0 times theorem prover too weak. 3624 trivial. 0 not checked. [2020-07-21 11:00:14,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:15,300 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,301 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,445 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,446 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,533 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,575 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,601 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,620 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,705 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 500 proven. 505 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2020-07-21 11:00:15,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173659490] [2020-07-21 11:00:15,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:15,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 14 [2020-07-21 11:00:15,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355404125] [2020-07-21 11:00:15,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-21 11:00:15,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-21 11:00:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-07-21 11:00:15,866 INFO L87 Difference]: Start difference. First operand 90 states and 167 transitions. Second operand 14 states. [2020-07-21 11:00:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:16,055 INFO L93 Difference]: Finished difference Result 135 states and 267 transitions. [2020-07-21 11:00:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 11:00:16,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 287 [2020-07-21 11:00:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:16,063 INFO L225 Difference]: With dead ends: 135 [2020-07-21 11:00:16,063 INFO L226 Difference]: Without dead ends: 123 [2020-07-21 11:00:16,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 550 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-07-21 11:00:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-21 11:00:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2020-07-21 11:00:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-21 11:00:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 181 transitions. [2020-07-21 11:00:16,088 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 181 transitions. Word has length 287 [2020-07-21 11:00:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:16,088 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 181 transitions. [2020-07-21 11:00:16,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-21 11:00:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 181 transitions. [2020-07-21 11:00:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-21 11:00:16,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:16,093 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:16,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:16,309 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340794, now seen corresponding path program 9 times [2020-07-21 11:00:16,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:16,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830880683] [2020-07-21 11:00:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 11:00:16,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 11:00:16,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 11:00:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 369 proven. 1029 refuted. 0 times theorem prover too weak. 3615 trivial. 0 not checked. [2020-07-21 11:00:16,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 11:00:18,151 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:18,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:18,627 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:18,628 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:18,943 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:18,944 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,091 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,092 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,185 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,265 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,266 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,324 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 11:00:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 375 proven. 1074 refuted. 0 times theorem prover too weak. 3564 trivial. 0 not checked. [2020-07-21 11:00:19,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830880683] [2020-07-21 11:00:19,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 11:00:19,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 18 [2020-07-21 11:00:19,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828261347] [2020-07-21 11:00:19,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 11:00:19,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 11:00:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 11:00:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-07-21 11:00:19,456 INFO L87 Difference]: Start difference. First operand 93 states and 181 transitions. Second operand 18 states. [2020-07-21 11:00:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 11:00:19,887 INFO L93 Difference]: Finished difference Result 183 states and 362 transitions. [2020-07-21 11:00:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 11:00:19,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 299 [2020-07-21 11:00:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 11:00:19,893 INFO L225 Difference]: With dead ends: 183 [2020-07-21 11:00:19,894 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 11:00:19,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 566 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2020-07-21 11:00:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 11:00:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-07-21 11:00:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-21 11:00:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2020-07-21 11:00:19,928 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 299 [2020-07-21 11:00:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 11:00:19,930 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2020-07-21 11:00:19,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 11:00:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2020-07-21 11:00:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 11:00:19,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 11:00:19,936 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 11:00:20,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:20,151 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 11:00:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 11:00:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 10 times [2020-07-21 11:00:20,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 11:00:20,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28549835] [2020-07-21 11:00:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:00:20,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:00:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 11:00:20,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 11:00:20,611 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 11:00:20,611 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 11:00:20,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 11:00:20,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:00:20 BoogieIcfgContainer [2020-07-21 11:00:20,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 11:00:20,930 INFO L168 Benchmark]: Toolchain (without parser) took 36007.63 ms. Allocated memory was 145.2 MB in the beginning and 610.3 MB in the end (delta: 465.0 MB). Free memory was 103.2 MB in the beginning and 238.6 MB in the end (delta: -135.4 MB). Peak memory consumption was 329.7 MB. Max. memory is 7.1 GB. [2020-07-21 11:00:20,931 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 11:00:20,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.75 ms. Allocated memory is still 145.2 MB. Free memory was 102.8 MB in the beginning and 93.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-21 11:00:20,933 INFO L168 Benchmark]: Boogie Preprocessor took 27.98 ms. Allocated memory is still 145.2 MB. Free memory was 93.6 MB in the beginning and 92.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 11:00:20,933 INFO L168 Benchmark]: RCFGBuilder took 384.35 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.2 MB in the beginning and 171.3 MB in the end (delta: -79.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-21 11:00:20,934 INFO L168 Benchmark]: TraceAbstraction took 35344.86 ms. Allocated memory was 203.4 MB in the beginning and 610.3 MB in the end (delta: 406.8 MB). Free memory was 170.6 MB in the beginning and 238.6 MB in the end (delta: -68.0 MB). Peak memory consumption was 338.9 MB. Max. memory is 7.1 GB. [2020-07-21 11:00:20,937 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.75 ms. Allocated memory is still 145.2 MB. Free memory was 102.8 MB in the beginning and 93.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.98 ms. Allocated memory is still 145.2 MB. Free memory was 93.6 MB in the beginning and 92.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 384.35 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.2 MB in the beginning and 171.3 MB in the end (delta: -79.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35344.86 ms. Allocated memory was 203.4 MB in the beginning and 610.3 MB in the end (delta: 406.8 MB). Free memory was 170.6 MB in the beginning and 238.6 MB in the end (delta: -68.0 MB). Peak memory consumption was 338.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.1s, OverallIterations: 18, TraceHistogramMax: 77, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 334 SDtfs, 674 SDslu, 1307 SDs, 0 SdLazy, 1614 SolverSat, 1095 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6208 GetRequests, 5790 SyntacticMatches, 152 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 228 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 3369 NumberOfCodeBlocks, 3369 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2716209 SizeOfPredicates, 92 NumberOfNonLiveVariables, 6890 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 92963/111120 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...