/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:40:10,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:40:10,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:40:10,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:40:10,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:40:10,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:40:10,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:40:10,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:40:10,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:40:10,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:40:10,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:40:10,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:40:10,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:40:10,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:40:10,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:40:10,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:40:10,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:40:10,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:40:10,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:40:10,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:40:10,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:40:10,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:40:10,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:40:10,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:40:10,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:40:10,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:40:10,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:40:10,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:40:10,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:40:10,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:40:10,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:40:10,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:40:10,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:40:10,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:40:10,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:40:10,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:40:10,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:40:10,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:40:10,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:40:10,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:40:10,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:40:10,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-02-10 20:40:10,528 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:40:10,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:40:10,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:40:10,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:40:10,530 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:40:10,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:40:10,530 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:40:10,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:40:10,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:40:10,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:40:10,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:40:10,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:40:10,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:40:10,532 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:40:10,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:40:10,532 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:40:10,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:40:10,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:40:10,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:40:10,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:40:10,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:40:10,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:40:10,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:40:10,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:40:10,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:40:10,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:40:10,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:40:10,534 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:40:10,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:40:10,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:40:10,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:40:10,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:40:10,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:40:10,834 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:40:10,834 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:40:10,835 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl [2020-02-10 20:40:10,836 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2020-02-10 20:40:10,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:40:10,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:40:10,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:10,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:40:10,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:40:10,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,909 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:40:10,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:40:10,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:40:10,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:40:10,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/1) ... [2020-02-10 20:40:10,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:40:10,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:40:10,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:40:10,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:40:10,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (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-02-10 20:40:11,007 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:40:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:40:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:40:11,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:40:11,010 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:40:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:40:11,010 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:40:11,010 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:40:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:40:11,011 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:40:11,011 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:40:11,011 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:40:11,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:40:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:40:11,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:40:11,013 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:40:11,203 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:40:11,203 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:40:11,207 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:11 BoogieIcfgContainer [2020-02-10 20:40:11,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:40:11,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:40:11,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:40:11,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:40:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:40:10" (1/2) ... [2020-02-10 20:40:11,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d27eec9 and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:40:11, skipping insertion in model container [2020-02-10 20:40:11,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:40:11" (2/2) ... [2020-02-10 20:40:11,218 INFO L109 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2020-02-10 20:40:11,229 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:40:11,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:40:11,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:40:11,241 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:40:11,371 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-02-10 20:40:11,398 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:40:11,398 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:40:11,398 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:40:11,398 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:40:11,399 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:40:11,400 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:40:11,401 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:40:11,401 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:40:11,416 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions [2020-02-10 20:40:11,418 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 20:40:11,467 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 20:40:11,467 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 20:40:11,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 17/47 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs. 0/46 useless extension candidates. Maximal degree in co-relation 41. Up to 12 conditions per place. [2020-02-10 20:40:11,477 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 20:40:11,504 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 20:40:11,504 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 20:40:11,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 17/47 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs. 0/46 useless extension candidates. Maximal degree in co-relation 41. Up to 12 conditions per place. [2020-02-10 20:40:11,511 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 216 [2020-02-10 20:40:11,515 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:40:11,629 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66 [2020-02-10 20:40:11,630 INFO L214 etLargeBlockEncoding]: Total number of compositions: 5 [2020-02-10 20:40:11,634 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions [2020-02-10 20:40:11,651 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 98 states. [2020-02-10 20:40:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-02-10 20:40:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:11,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:11,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:11,665 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1774799827, now seen corresponding path program 1 times [2020-02-10 20:40:11,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:11,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765527481] [2020-02-10 20:40:11,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:11,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765527481] [2020-02-10 20:40:11,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:11,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:11,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436091354] [2020-02-10 20:40:11,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:11,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:11,854 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-02-10 20:40:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:11,881 INFO L93 Difference]: Finished difference Result 72 states and 170 transitions. [2020-02-10 20:40:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:11,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:40:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:11,895 INFO L225 Difference]: With dead ends: 72 [2020-02-10 20:40:11,896 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 20:40:11,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 20:40:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-02-10 20:40:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:40:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 169 transitions. [2020-02-10 20:40:11,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 169 transitions. Word has length 13 [2020-02-10 20:40:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:11,946 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 169 transitions. [2020-02-10 20:40:11,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 169 transitions. [2020-02-10 20:40:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:11,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:11,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:11,950 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 828669875, now seen corresponding path program 1 times [2020-02-10 20:40:11,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:11,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965396368] [2020-02-10 20:40:11,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:11,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965396368] [2020-02-10 20:40:11,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:11,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:11,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242513670] [2020-02-10 20:40:11,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:11,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:11,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:11,981 INFO L87 Difference]: Start difference. First operand 71 states and 169 transitions. Second operand 3 states. [2020-02-10 20:40:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:11,989 INFO L93 Difference]: Finished difference Result 55 states and 121 transitions. [2020-02-10 20:40:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:11,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:40:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:11,992 INFO L225 Difference]: With dead ends: 55 [2020-02-10 20:40:11,992 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 20:40:11,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 20:40:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-02-10 20:40:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:40:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2020-02-10 20:40:12,004 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 13 [2020-02-10 20:40:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:12,004 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2020-02-10 20:40:12,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2020-02-10 20:40:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:12,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:12,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:12,006 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 857298065, now seen corresponding path program 1 times [2020-02-10 20:40:12,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:12,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591459340] [2020-02-10 20:40:12,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:12,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591459340] [2020-02-10 20:40:12,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:12,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:12,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296950336] [2020-02-10 20:40:12,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:12,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:12,269 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand 6 states. [2020-02-10 20:40:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:12,391 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-02-10 20:40:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:12,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:12,397 INFO L225 Difference]: With dead ends: 85 [2020-02-10 20:40:12,397 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 20:40:12,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 20:40:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-02-10 20:40:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-02-10 20:40:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 124 transitions. [2020-02-10 20:40:12,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 124 transitions. Word has length 13 [2020-02-10 20:40:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:12,408 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 124 transitions. [2020-02-10 20:40:12,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2020-02-10 20:40:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:12,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:12,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:12,409 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 27913103, now seen corresponding path program 2 times [2020-02-10 20:40:12,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:12,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667946827] [2020-02-10 20:40:12,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:12,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667946827] [2020-02-10 20:40:12,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:12,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:12,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964721539] [2020-02-10 20:40:12,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:12,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:12,619 INFO L87 Difference]: Start difference. First operand 57 states and 124 transitions. Second operand 6 states. [2020-02-10 20:40:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:12,708 INFO L93 Difference]: Finished difference Result 87 states and 163 transitions. [2020-02-10 20:40:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:12,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:12,710 INFO L225 Difference]: With dead ends: 87 [2020-02-10 20:40:12,710 INFO L226 Difference]: Without dead ends: 75 [2020-02-10 20:40:12,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-02-10 20:40:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-02-10 20:40:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:40:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2020-02-10 20:40:12,725 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 119 transitions. Word has length 13 [2020-02-10 20:40:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:12,725 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 119 transitions. [2020-02-10 20:40:12,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 119 transitions. [2020-02-10 20:40:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:12,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:12,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:12,728 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1712604719, now seen corresponding path program 3 times [2020-02-10 20:40:12,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:12,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442271789] [2020-02-10 20:40:12,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:12,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442271789] [2020-02-10 20:40:12,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:12,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:12,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136702381] [2020-02-10 20:40:12,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:12,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:12,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:12,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:12,888 INFO L87 Difference]: Start difference. First operand 55 states and 119 transitions. Second operand 6 states. [2020-02-10 20:40:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:12,950 INFO L93 Difference]: Finished difference Result 88 states and 163 transitions. [2020-02-10 20:40:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:12,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:12,952 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:40:12,953 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 20:40:12,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 20:40:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2020-02-10 20:40:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 20:40:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2020-02-10 20:40:12,970 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 13 [2020-02-10 20:40:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:12,970 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 124 transitions. [2020-02-10 20:40:12,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 124 transitions. [2020-02-10 20:40:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:12,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:12,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:12,972 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1769799917, now seen corresponding path program 4 times [2020-02-10 20:40:12,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:12,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522251747] [2020-02-10 20:40:12,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:13,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522251747] [2020-02-10 20:40:13,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112299100] [2020-02-10 20:40:13,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:13,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:13,151 INFO L87 Difference]: Start difference. First operand 58 states and 124 transitions. Second operand 6 states. [2020-02-10 20:40:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:13,213 INFO L93 Difference]: Finished difference Result 92 states and 169 transitions. [2020-02-10 20:40:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:13,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:13,216 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:40:13,216 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 20:40:13,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 20:40:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2020-02-10 20:40:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:40:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2020-02-10 20:40:13,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 116 transitions. Word has length 13 [2020-02-10 20:40:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:13,231 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 116 transitions. [2020-02-10 20:40:13,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 116 transitions. [2020-02-10 20:40:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:13,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:13,234 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:13,234 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1800964241, now seen corresponding path program 5 times [2020-02-10 20:40:13,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:13,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901976165] [2020-02-10 20:40:13,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:13,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901976165] [2020-02-10 20:40:13,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:13,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:13,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67725117] [2020-02-10 20:40:13,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:13,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:13,402 INFO L87 Difference]: Start difference. First operand 55 states and 116 transitions. Second operand 6 states. [2020-02-10 20:40:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:13,461 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 20:40:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:13,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:13,463 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:40:13,463 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 20:40:13,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 20:40:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2020-02-10 20:40:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 20:40:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 20:40:13,479 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 13 [2020-02-10 20:40:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:13,479 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 20:40:13,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 20:40:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:13,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:13,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:13,480 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1828669871, now seen corresponding path program 6 times [2020-02-10 20:40:13,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:13,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509987333] [2020-02-10 20:40:13,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:13,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509987333] [2020-02-10 20:40:13,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:13,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:13,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249014638] [2020-02-10 20:40:13,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:13,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:13,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:13,655 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 6 states. [2020-02-10 20:40:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:13,705 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2020-02-10 20:40:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:13,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:13,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:13,706 INFO L225 Difference]: With dead ends: 97 [2020-02-10 20:40:13,707 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:40:13,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:40:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 20:40:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:40:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 104 transitions. [2020-02-10 20:40:13,717 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 104 transitions. Word has length 13 [2020-02-10 20:40:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:13,717 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 104 transitions. [2020-02-10 20:40:13,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 104 transitions. [2020-02-10 20:40:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:13,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:13,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:13,720 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1602000563, now seen corresponding path program 7 times [2020-02-10 20:40:13,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:13,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115189872] [2020-02-10 20:40:13,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:13,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115189872] [2020-02-10 20:40:13,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:13,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:13,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986277121] [2020-02-10 20:40:13,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:13,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:13,827 INFO L87 Difference]: Start difference. First operand 50 states and 104 transitions. Second operand 6 states. [2020-02-10 20:40:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:13,879 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-02-10 20:40:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:13,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:13,881 INFO L225 Difference]: With dead ends: 78 [2020-02-10 20:40:13,881 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 20:40:13,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 20:40:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2020-02-10 20:40:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:40:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2020-02-10 20:40:13,886 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 13 [2020-02-10 20:40:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:13,887 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2020-02-10 20:40:13,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2020-02-10 20:40:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:13,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:13,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:13,888 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash 772615601, now seen corresponding path program 8 times [2020-02-10 20:40:13,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:13,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667446201] [2020-02-10 20:40:13,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667446201] [2020-02-10 20:40:14,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842201615] [2020-02-10 20:40:14,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,055 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 6 states. [2020-02-10 20:40:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,113 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-02-10 20:40:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:14,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,119 INFO L225 Difference]: With dead ends: 80 [2020-02-10 20:40:14,119 INFO L226 Difference]: Without dead ends: 68 [2020-02-10 20:40:14,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-02-10 20:40:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2020-02-10 20:40:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:40:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2020-02-10 20:40:14,124 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 13 [2020-02-10 20:40:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,124 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2020-02-10 20:40:14,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2020-02-10 20:40:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,126 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -982353425, now seen corresponding path program 9 times [2020-02-10 20:40:14,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726586063] [2020-02-10 20:40:14,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726586063] [2020-02-10 20:40:14,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137977446] [2020-02-10 20:40:14,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,280 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 6 states. [2020-02-10 20:40:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,327 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2020-02-10 20:40:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:14,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,328 INFO L225 Difference]: With dead ends: 73 [2020-02-10 20:40:14,328 INFO L226 Difference]: Without dead ends: 65 [2020-02-10 20:40:14,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-02-10 20:40:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2020-02-10 20:40:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:40:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2020-02-10 20:40:14,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 13 [2020-02-10 20:40:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,332 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 99 transitions. [2020-02-10 20:40:14,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 99 transitions. [2020-02-10 20:40:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,334 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1591588975, now seen corresponding path program 1 times [2020-02-10 20:40:14,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482966449] [2020-02-10 20:40:14,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482966449] [2020-02-10 20:40:14,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:40:14,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187881505] [2020-02-10 20:40:14,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:40:14,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:40:14,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:14,356 INFO L87 Difference]: Start difference. First operand 49 states and 99 transitions. Second operand 3 states. [2020-02-10 20:40:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,357 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2020-02-10 20:40:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:40:14,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:40:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,362 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:40:14,362 INFO L226 Difference]: Without dead ends: 41 [2020-02-10 20:40:14,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:40:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-02-10 20:40:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-02-10 20:40:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:40:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-02-10 20:40:14,365 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 13 [2020-02-10 20:40:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,365 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-02-10 20:40:14,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:40:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-02-10 20:40:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,366 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2065265875, now seen corresponding path program 10 times [2020-02-10 20:40:14,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831836313] [2020-02-10 20:40:14,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831836313] [2020-02-10 20:40:14,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134850886] [2020-02-10 20:40:14,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,491 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 6 states. [2020-02-10 20:40:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,538 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2020-02-10 20:40:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:14,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,539 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:40:14,539 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 20:40:14,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 20:40:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2020-02-10 20:40:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 20:40:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-02-10 20:40:14,541 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 13 [2020-02-10 20:40:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,542 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-02-10 20:40:14,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-02-10 20:40:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,543 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1202823469, now seen corresponding path program 11 times [2020-02-10 20:40:14,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838588798] [2020-02-10 20:40:14,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838588798] [2020-02-10 20:40:14,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918879970] [2020-02-10 20:40:14,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,645 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 6 states. [2020-02-10 20:40:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,696 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-02-10 20:40:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:14,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,697 INFO L225 Difference]: With dead ends: 62 [2020-02-10 20:40:14,697 INFO L226 Difference]: Without dead ends: 54 [2020-02-10 20:40:14,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-02-10 20:40:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2020-02-10 20:40:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:40:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 74 transitions. [2020-02-10 20:40:14,701 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 74 transitions. Word has length 13 [2020-02-10 20:40:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,701 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 74 transitions. [2020-02-10 20:40:14,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 74 transitions. [2020-02-10 20:40:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,702 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1374394767, now seen corresponding path program 12 times [2020-02-10 20:40:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150215899] [2020-02-10 20:40:14,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150215899] [2020-02-10 20:40:14,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74894036] [2020-02-10 20:40:14,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,797 INFO L87 Difference]: Start difference. First operand 41 states and 74 transitions. Second operand 6 states. [2020-02-10 20:40:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:14,832 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2020-02-10 20:40:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:14,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:14,834 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:40:14,834 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 20:40:14,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 20:40:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-02-10 20:40:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:40:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-02-10 20:40:14,838 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2020-02-10 20:40:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:14,839 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2020-02-10 20:40:14,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2020-02-10 20:40:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:14,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:14,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:14,840 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1092957581, now seen corresponding path program 13 times [2020-02-10 20:40:14,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:14,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917116808] [2020-02-10 20:40:14,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:14,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917116808] [2020-02-10 20:40:14,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:14,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:14,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196465166] [2020-02-10 20:40:14,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:14,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:14,951 INFO L87 Difference]: Start difference. First operand 39 states and 71 transitions. Second operand 6 states. [2020-02-10 20:40:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,004 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-02-10 20:40:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,005 INFO L225 Difference]: With dead ends: 63 [2020-02-10 20:40:15,006 INFO L226 Difference]: Without dead ends: 56 [2020-02-10 20:40:15,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-02-10 20:40:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2020-02-10 20:40:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:40:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. [2020-02-10 20:40:15,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 13 [2020-02-10 20:40:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,010 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. [2020-02-10 20:40:15,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2020-02-10 20:40:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,011 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1035762383, now seen corresponding path program 14 times [2020-02-10 20:40:15,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088644233] [2020-02-10 20:40:15,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088644233] [2020-02-10 20:40:15,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214966066] [2020-02-10 20:40:15,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,128 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 6 states. [2020-02-10 20:40:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,160 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-02-10 20:40:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,161 INFO L225 Difference]: With dead ends: 66 [2020-02-10 20:40:15,161 INFO L226 Difference]: Without dead ends: 53 [2020-02-10 20:40:15,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-02-10 20:40:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-02-10 20:40:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-02-10 20:40:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-02-10 20:40:15,164 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 13 [2020-02-10 20:40:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,165 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-02-10 20:40:15,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-02-10 20:40:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,166 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -237650927, now seen corresponding path program 15 times [2020-02-10 20:40:15,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337129224] [2020-02-10 20:40:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337129224] [2020-02-10 20:40:15,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885936493] [2020-02-10 20:40:15,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,275 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 6 states. [2020-02-10 20:40:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,321 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2020-02-10 20:40:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,322 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:40:15,322 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 20:40:15,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 20:40:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-02-10 20:40:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-02-10 20:40:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2020-02-10 20:40:15,324 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 13 [2020-02-10 20:40:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,325 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. [2020-02-10 20:40:15,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. [2020-02-10 20:40:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,326 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1484998923, now seen corresponding path program 16 times [2020-02-10 20:40:15,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430771755] [2020-02-10 20:40:15,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430771755] [2020-02-10 20:40:15,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811876462] [2020-02-10 20:40:15,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,427 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 6 states. [2020-02-10 20:40:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,457 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2020-02-10 20:40:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,458 INFO L225 Difference]: With dead ends: 47 [2020-02-10 20:40:15,458 INFO L226 Difference]: Without dead ends: 40 [2020-02-10 20:40:15,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-02-10 20:40:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2020-02-10 20:40:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 20:40:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2020-02-10 20:40:15,460 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2020-02-10 20:40:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,460 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2020-02-10 20:40:15,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2020-02-10 20:40:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,461 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -633260145, now seen corresponding path program 17 times [2020-02-10 20:40:15,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768126111] [2020-02-10 20:40:15,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768126111] [2020-02-10 20:40:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134583676] [2020-02-10 20:40:15,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,676 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand 6 states. [2020-02-10 20:40:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,712 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2020-02-10 20:40:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,713 INFO L225 Difference]: With dead ends: 52 [2020-02-10 20:40:15,713 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 20:40:15,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 20:40:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 20:40:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:40:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-02-10 20:40:15,717 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 13 [2020-02-10 20:40:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,717 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-02-10 20:40:15,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-02-10 20:40:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,719 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 225614385, now seen corresponding path program 18 times [2020-02-10 20:40:15,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391367977] [2020-02-10 20:40:15,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391367977] [2020-02-10 20:40:15,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268015051] [2020-02-10 20:40:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,818 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 6 states. [2020-02-10 20:40:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,846 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-02-10 20:40:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:15,848 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:40:15,848 INFO L226 Difference]: Without dead ends: 31 [2020-02-10 20:40:15,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-02-10 20:40:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-02-10 20:40:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:40:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-02-10 20:40:15,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2020-02-10 20:40:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:15,851 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-02-10 20:40:15,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-02-10 20:40:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:15,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:15,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:15,852 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1836921811, now seen corresponding path program 19 times [2020-02-10 20:40:15,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:15,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642500336] [2020-02-10 20:40:15,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:15,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642500336] [2020-02-10 20:40:15,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:15,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:15,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973012710] [2020-02-10 20:40:15,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:15,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:15,959 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-02-10 20:40:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:15,999 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-02-10 20:40:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:15,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,000 INFO L225 Difference]: With dead ends: 45 [2020-02-10 20:40:16,000 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 20:40:16,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 20:40:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-02-10 20:40:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:40:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-02-10 20:40:16,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2020-02-10 20:40:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,002 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-02-10 20:40:16,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-02-10 20:40:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:16,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:16,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:16,003 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1599170955, now seen corresponding path program 20 times [2020-02-10 20:40:16,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:16,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322939098] [2020-02-10 20:40:16,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:16,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322939098] [2020-02-10 20:40:16,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:16,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:16,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746149143] [2020-02-10 20:40:16,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:16,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:16,117 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 6 states. [2020-02-10 20:40:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:16,145 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-02-10 20:40:16,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:16,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,146 INFO L225 Difference]: With dead ends: 47 [2020-02-10 20:40:16,146 INFO L226 Difference]: Without dead ends: 32 [2020-02-10 20:40:16,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-02-10 20:40:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-02-10 20:40:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 20:40:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-02-10 20:40:16,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2020-02-10 20:40:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,148 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-02-10 20:40:16,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2020-02-10 20:40:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:16,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:16,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:16,149 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1602738831, now seen corresponding path program 21 times [2020-02-10 20:40:16,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:16,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317426228] [2020-02-10 20:40:16,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:16,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317426228] [2020-02-10 20:40:16,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:16,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:16,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901489858] [2020-02-10 20:40:16,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:16,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:16,234 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 6 states. [2020-02-10 20:40:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:16,272 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-02-10 20:40:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:16,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,273 INFO L225 Difference]: With dead ends: 37 [2020-02-10 20:40:16,273 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 20:40:16,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 20:40:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2020-02-10 20:40:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-02-10 20:40:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-02-10 20:40:16,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2020-02-10 20:40:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,275 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-02-10 20:40:16,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-02-10 20:40:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:16,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:16,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:16,276 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 115010229, now seen corresponding path program 22 times [2020-02-10 20:40:16,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:16,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919656450] [2020-02-10 20:40:16,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:16,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919656450] [2020-02-10 20:40:16,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:16,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:16,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464956343] [2020-02-10 20:40:16,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:16,384 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 6 states. [2020-02-10 20:40:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:16,416 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-02-10 20:40:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:16,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,418 INFO L225 Difference]: With dead ends: 29 [2020-02-10 20:40:16,418 INFO L226 Difference]: Without dead ends: 22 [2020-02-10 20:40:16,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-02-10 20:40:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-02-10 20:40:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-02-10 20:40:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-02-10 20:40:16,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2020-02-10 20:40:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,421 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-02-10 20:40:16,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-02-10 20:40:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:16,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:16,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:16,422 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 111442353, now seen corresponding path program 23 times [2020-02-10 20:40:16,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:16,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901517425] [2020-02-10 20:40:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:16,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901517425] [2020-02-10 20:40:16,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:16,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:16,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702368523] [2020-02-10 20:40:16,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:16,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:16,530 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2020-02-10 20:40:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:16,554 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-02-10 20:40:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:16,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,555 INFO L225 Difference]: With dead ends: 27 [2020-02-10 20:40:16,555 INFO L226 Difference]: Without dead ends: 17 [2020-02-10 20:40:16,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-02-10 20:40:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-02-10 20:40:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-02-10 20:40:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-02-10 20:40:16,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2020-02-10 20:40:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,558 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-02-10 20:40:16,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-02-10 20:40:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:40:16,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:40:16,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:40:16,559 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:40:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:40:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 970316883, now seen corresponding path program 24 times [2020-02-10 20:40:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:40:16,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523132197] [2020-02-10 20:40:16,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:40:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:40:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:40:16,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523132197] [2020-02-10 20:40:16,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:40:16,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:40:16,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245398420] [2020-02-10 20:40:16,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:40:16,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:40:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:40:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:40:16,660 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2020-02-10 20:40:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:40:16,686 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-02-10 20:40:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:40:16,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:40:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:40:16,687 INFO L225 Difference]: With dead ends: 16 [2020-02-10 20:40:16,687 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:40:16,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:40:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:40:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:40:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:40:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:40:16,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-02-10 20:40:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:40:16,688 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:40:16,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:40:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:40:16,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:40:16,693 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:40:16 BasicIcfg [2020-02-10 20:40:16,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:40:16,695 INFO L168 Benchmark]: Toolchain (without parser) took 5823.69 ms. Allocated memory was 145.2 MB in the beginning and 289.4 MB in the end (delta: 144.2 MB). Free memory was 120.3 MB in the beginning and 256.5 MB in the end (delta: -136.2 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:16,696 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.01 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). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:40:16,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 118.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:16,697 INFO L168 Benchmark]: Boogie Preprocessor took 21.97 ms. Allocated memory is still 145.2 MB. Free memory was 118.4 MB in the beginning and 117.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:16,697 INFO L168 Benchmark]: RCFGBuilder took 274.99 ms. Allocated memory is still 145.2 MB. Free memory was 117.3 MB in the beginning and 106.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:40:16,698 INFO L168 Benchmark]: TraceAbstraction took 5483.63 ms. Allocated memory was 145.2 MB in the beginning and 289.4 MB in the end (delta: 144.2 MB). Free memory was 105.9 MB in the beginning and 256.5 MB in the end (delta: -150.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-02-10 20:40:16,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.01 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). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.47 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 118.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.97 ms. Allocated memory is still 145.2 MB. Free memory was 118.4 MB in the beginning and 117.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.99 ms. Allocated memory is still 145.2 MB. Free memory was 117.3 MB in the beginning and 106.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5483.63 ms. Allocated memory was 145.2 MB in the beginning and 289.4 MB in the end (delta: 144.2 MB). Free memory was 105.9 MB in the beginning and 256.5 MB in the end (delta: -150.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.2s, 36 ProgramPointsBefore, 31 ProgramPointsAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 66 CheckedPairsTotal, 5 TotalNumberOfCompositions - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 5.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 669 SDtfs, 920 SDslu, 945 SDs, 0 SdLazy, 329 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 294 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 42696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...