/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:36,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:36,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:36,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:36,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:36,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:36,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:36,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:36,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:36,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:36,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:36,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:36,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:36,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:36,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:36,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:36,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:36,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:36,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:36,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:36,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:36,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:36,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:36,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:36,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:36,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:36,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:36,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:36,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:36,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:36,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:36,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:36,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:36,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:36,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:36,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:36,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:36,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:36,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:36,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:36,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:36,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:43:36,420 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:36,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:36,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:36,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:36,422 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:36,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:36,422 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:36,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:36,423 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:36,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:36,424 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:36,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:36,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:36,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:36,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:36,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:36,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:36,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:36,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:36,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:36,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:36,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:36,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:36,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:36,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:36,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:36,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:36,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:36,728 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:36,728 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:36,729 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 19:43:36,729 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2020-02-10 19:43:36,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:36,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:36,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:36,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:36,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:36,778 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,787 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:36,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:36,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:36,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:36,803 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,803 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,804 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,804 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,807 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,807 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,808 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 07:43:36" (1/1) ... [2020-02-10 19:43:36,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:36,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:36,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:36,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:36,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:36" (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 19:43:36,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:36,879 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:36,881 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:36,881 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:36,882 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:36,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:36,882 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:36,883 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:36,883 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:36,883 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:36,883 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:36,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:36,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:36,885 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 19:43:37,070 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:37,070 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:37,074 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:37 BoogieIcfgContainer [2020-02-10 19:43:37,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:37,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:37,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:37,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:37,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:36" (1/2) ... [2020-02-10 19:43:37,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a285eb and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:37, skipping insertion in model container [2020-02-10 19:43:37,083 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 07:43:37" (2/2) ... [2020-02-10 19:43:37,086 INFO L109 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2020-02-10 19:43:37,098 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:37,098 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:37,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:37,107 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:37,222 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-02-10 19:43:37,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:37,244 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:37,244 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:37,245 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:37,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:37,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:37,245 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:37,245 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:37,265 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions [2020-02-10 19:43:37,268 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 19:43:37,349 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 19:43:37,349 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 19:43:37,361 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 19:43:37,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 19:43:37,403 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 19:43:37,403 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 19:43:37,409 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 19:43:37,417 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 216 [2020-02-10 19:43:37,418 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:37,499 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66 [2020-02-10 19:43:37,499 INFO L214 etLargeBlockEncoding]: Total number of compositions: 5 [2020-02-10 19:43:37,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions [2020-02-10 19:43:37,520 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 98 states. [2020-02-10 19:43:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-02-10 19:43:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:37,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:37,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:37,533 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1774799827, now seen corresponding path program 1 times [2020-02-10 19:43:37,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:37,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793390245] [2020-02-10 19:43:37,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:37,694 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 19:43:37,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793390245] [2020-02-10 19:43:37,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:37,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:37,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052979472] [2020-02-10 19:43:37,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:37,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:37,720 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-02-10 19:43:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:37,751 INFO L93 Difference]: Finished difference Result 72 states and 170 transitions. [2020-02-10 19:43:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:37,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 19:43:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:37,766 INFO L225 Difference]: With dead ends: 72 [2020-02-10 19:43:37,766 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 19:43:37,767 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 19:43:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 19:43:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-02-10 19:43:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 19:43:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 169 transitions. [2020-02-10 19:43:37,814 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 169 transitions. Word has length 13 [2020-02-10 19:43:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:37,815 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 169 transitions. [2020-02-10 19:43:37,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 169 transitions. [2020-02-10 19:43:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:37,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:37,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:37,818 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash 828669875, now seen corresponding path program 1 times [2020-02-10 19:43:37,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:37,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566415165] [2020-02-10 19:43:37,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:37,851 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 19:43:37,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566415165] [2020-02-10 19:43:37,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:37,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:37,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270017940] [2020-02-10 19:43:37,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:37,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:37,856 INFO L87 Difference]: Start difference. First operand 71 states and 169 transitions. Second operand 3 states. [2020-02-10 19:43:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:37,864 INFO L93 Difference]: Finished difference Result 55 states and 121 transitions. [2020-02-10 19:43:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:37,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 19:43:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:37,867 INFO L225 Difference]: With dead ends: 55 [2020-02-10 19:43:37,867 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 19:43:37,878 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 19:43:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 19:43:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-02-10 19:43:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 19:43:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2020-02-10 19:43:37,889 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 13 [2020-02-10 19:43:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:37,892 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2020-02-10 19:43:37,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2020-02-10 19:43:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:37,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:37,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:37,895 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash 857298065, now seen corresponding path program 1 times [2020-02-10 19:43:37,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:37,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900642025] [2020-02-10 19:43:37,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:38,150 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 19:43:38,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900642025] [2020-02-10 19:43:38,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:38,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:38,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901003459] [2020-02-10 19:43:38,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:38,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:38,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:38,157 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand 6 states. [2020-02-10 19:43:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:38,270 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-02-10 19:43:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:38,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:38,275 INFO L225 Difference]: With dead ends: 85 [2020-02-10 19:43:38,276 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 19:43:38,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 19:43:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 19:43:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-02-10 19:43:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-02-10 19:43:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 124 transitions. [2020-02-10 19:43:38,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 124 transitions. Word has length 13 [2020-02-10 19:43:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:38,296 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 124 transitions. [2020-02-10 19:43:38,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2020-02-10 19:43:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:38,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:38,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:38,298 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash 27913103, now seen corresponding path program 2 times [2020-02-10 19:43:38,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:38,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684970832] [2020-02-10 19:43:38,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:38,474 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 19:43:38,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684970832] [2020-02-10 19:43:38,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:38,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:38,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640063773] [2020-02-10 19:43:38,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:38,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:38,477 INFO L87 Difference]: Start difference. First operand 57 states and 124 transitions. Second operand 6 states. [2020-02-10 19:43:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:38,562 INFO L93 Difference]: Finished difference Result 87 states and 163 transitions. [2020-02-10 19:43:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:38,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:38,564 INFO L225 Difference]: With dead ends: 87 [2020-02-10 19:43:38,565 INFO L226 Difference]: Without dead ends: 75 [2020-02-10 19:43:38,565 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 19:43:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-02-10 19:43:38,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-02-10 19:43:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 19:43:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2020-02-10 19:43:38,583 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 119 transitions. Word has length 13 [2020-02-10 19:43:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:38,583 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 119 transitions. [2020-02-10 19:43:38,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 119 transitions. [2020-02-10 19:43:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:38,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:38,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:38,587 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1712604719, now seen corresponding path program 3 times [2020-02-10 19:43:38,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:38,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354085375] [2020-02-10 19:43:38,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:38,730 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 19:43:38,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354085375] [2020-02-10 19:43:38,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020608032] [2020-02-10 19:43:38,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:38,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:38,733 INFO L87 Difference]: Start difference. First operand 55 states and 119 transitions. Second operand 6 states. [2020-02-10 19:43:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:38,800 INFO L93 Difference]: Finished difference Result 88 states and 163 transitions. [2020-02-10 19:43:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:38,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:38,802 INFO L225 Difference]: With dead ends: 88 [2020-02-10 19:43:38,802 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 19:43:38,803 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 19:43:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 19:43:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2020-02-10 19:43:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 19:43:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2020-02-10 19:43:38,813 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 13 [2020-02-10 19:43:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:38,814 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 124 transitions. [2020-02-10 19:43:38,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 124 transitions. [2020-02-10 19:43:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:38,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:38,816 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:38,816 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1769799917, now seen corresponding path program 4 times [2020-02-10 19:43:38,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:38,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471277083] [2020-02-10 19:43:38,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:38,991 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 19:43:38,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471277083] [2020-02-10 19:43:38,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:38,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:38,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968302468] [2020-02-10 19:43:38,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:38,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:38,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:38,997 INFO L87 Difference]: Start difference. First operand 58 states and 124 transitions. Second operand 6 states. [2020-02-10 19:43:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:39,061 INFO L93 Difference]: Finished difference Result 92 states and 169 transitions. [2020-02-10 19:43:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:39,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:39,064 INFO L225 Difference]: With dead ends: 92 [2020-02-10 19:43:39,065 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 19:43:39,065 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 19:43:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 19:43:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2020-02-10 19:43:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 19:43:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2020-02-10 19:43:39,081 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 116 transitions. Word has length 13 [2020-02-10 19:43:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:39,082 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 116 transitions. [2020-02-10 19:43:39,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 116 transitions. [2020-02-10 19:43:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:39,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:39,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:39,087 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1800964241, now seen corresponding path program 5 times [2020-02-10 19:43:39,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:39,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741958279] [2020-02-10 19:43:39,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:39,253 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 19:43:39,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741958279] [2020-02-10 19:43:39,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:39,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:39,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417303680] [2020-02-10 19:43:39,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:39,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:39,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:39,256 INFO L87 Difference]: Start difference. First operand 55 states and 116 transitions. Second operand 6 states. [2020-02-10 19:43:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:39,318 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 19:43:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:39,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:39,320 INFO L225 Difference]: With dead ends: 95 [2020-02-10 19:43:39,320 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 19:43:39,320 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 19:43:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 19:43:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2020-02-10 19:43:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 19:43:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 19:43:39,332 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 13 [2020-02-10 19:43:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:39,338 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 19:43:39,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 19:43:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:39,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:39,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:39,340 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1828669871, now seen corresponding path program 6 times [2020-02-10 19:43:39,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:39,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552133330] [2020-02-10 19:43:39,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:39,512 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 19:43:39,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552133330] [2020-02-10 19:43:39,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:39,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:39,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239471832] [2020-02-10 19:43:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:39,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:39,515 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 6 states. [2020-02-10 19:43:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:39,562 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2020-02-10 19:43:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:39,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:39,563 INFO L225 Difference]: With dead ends: 97 [2020-02-10 19:43:39,564 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 19:43:39,564 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 19:43:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 19:43:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 19:43:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:43:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 104 transitions. [2020-02-10 19:43:39,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 104 transitions. Word has length 13 [2020-02-10 19:43:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:39,570 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 104 transitions. [2020-02-10 19:43:39,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 104 transitions. [2020-02-10 19:43:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:39,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:39,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:39,571 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1602000563, now seen corresponding path program 7 times [2020-02-10 19:43:39,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:39,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23198066] [2020-02-10 19:43:39,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:39,692 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 19:43:39,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23198066] [2020-02-10 19:43:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:39,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:39,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137535231] [2020-02-10 19:43:39,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:39,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:39,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:39,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:39,695 INFO L87 Difference]: Start difference. First operand 50 states and 104 transitions. Second operand 6 states. [2020-02-10 19:43:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:39,756 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-02-10 19:43:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:39,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:39,758 INFO L225 Difference]: With dead ends: 78 [2020-02-10 19:43:39,758 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 19:43:39,758 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 19:43:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 19:43:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2020-02-10 19:43:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 19:43:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2020-02-10 19:43:39,763 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 13 [2020-02-10 19:43:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:39,764 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2020-02-10 19:43:39,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2020-02-10 19:43:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:39,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:39,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:39,765 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash 772615601, now seen corresponding path program 8 times [2020-02-10 19:43:39,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:39,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466004864] [2020-02-10 19:43:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:39,920 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 19:43:39,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466004864] [2020-02-10 19:43:39,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:39,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:39,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486357739] [2020-02-10 19:43:39,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:39,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:39,922 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 6 states. [2020-02-10 19:43:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:39,990 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-02-10 19:43:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:39,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:39,992 INFO L225 Difference]: With dead ends: 80 [2020-02-10 19:43:39,992 INFO L226 Difference]: Without dead ends: 68 [2020-02-10 19:43:39,993 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 19:43:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-02-10 19:43:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2020-02-10 19:43:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 19:43:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2020-02-10 19:43:39,997 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 13 [2020-02-10 19:43:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:39,997 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2020-02-10 19:43:39,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2020-02-10 19:43:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:39,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:39,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:39,999 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash -982353425, now seen corresponding path program 9 times [2020-02-10 19:43:39,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380874311] [2020-02-10 19:43:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,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 19:43:40,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380874311] [2020-02-10 19:43:40,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287752983] [2020-02-10 19:43:40,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,116 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 6 states. [2020-02-10 19:43:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,162 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2020-02-10 19:43:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,163 INFO L225 Difference]: With dead ends: 73 [2020-02-10 19:43:40,163 INFO L226 Difference]: Without dead ends: 65 [2020-02-10 19:43:40,163 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 19:43:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-02-10 19:43:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2020-02-10 19:43:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 19:43:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2020-02-10 19:43:40,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 13 [2020-02-10 19:43:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,167 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 99 transitions. [2020-02-10 19:43:40,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 99 transitions. [2020-02-10 19:43:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,169 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1591588975, now seen corresponding path program 1 times [2020-02-10 19:43:40,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895724142] [2020-02-10 19:43:40,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,189 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 19:43:40,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895724142] [2020-02-10 19:43:40,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:40,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780635803] [2020-02-10 19:43:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:40,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:40,191 INFO L87 Difference]: Start difference. First operand 49 states and 99 transitions. Second operand 3 states. [2020-02-10 19:43:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,196 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2020-02-10 19:43:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:40,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 19:43:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,197 INFO L225 Difference]: With dead ends: 41 [2020-02-10 19:43:40,197 INFO L226 Difference]: Without dead ends: 41 [2020-02-10 19:43:40,198 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 19:43:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-02-10 19:43:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-02-10 19:43:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 19:43:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-02-10 19:43:40,203 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 13 [2020-02-10 19:43:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,203 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-02-10 19:43:40,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-02-10 19:43:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,204 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2065265875, now seen corresponding path program 10 times [2020-02-10 19:43:40,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705683711] [2020-02-10 19:43:40,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,316 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 19:43:40,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705683711] [2020-02-10 19:43:40,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547821135] [2020-02-10 19:43:40,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,319 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 6 states. [2020-02-10 19:43:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,354 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2020-02-10 19:43:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,355 INFO L225 Difference]: With dead ends: 54 [2020-02-10 19:43:40,355 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 19:43:40,356 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 19:43:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 19:43:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2020-02-10 19:43:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 19:43:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-02-10 19:43:40,358 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 13 [2020-02-10 19:43:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,359 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-02-10 19:43:40,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-02-10 19:43:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,360 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1202823469, now seen corresponding path program 11 times [2020-02-10 19:43:40,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393172451] [2020-02-10 19:43:40,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,455 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 19:43:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393172451] [2020-02-10 19:43:40,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894735363] [2020-02-10 19:43:40,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,457 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 6 states. [2020-02-10 19:43:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,496 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-02-10 19:43:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,497 INFO L225 Difference]: With dead ends: 62 [2020-02-10 19:43:40,497 INFO L226 Difference]: Without dead ends: 54 [2020-02-10 19:43:40,498 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 19:43:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-02-10 19:43:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2020-02-10 19:43:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 19:43:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 74 transitions. [2020-02-10 19:43:40,500 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 74 transitions. Word has length 13 [2020-02-10 19:43:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,501 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 74 transitions. [2020-02-10 19:43:40,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 74 transitions. [2020-02-10 19:43:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,503 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1374394767, now seen corresponding path program 12 times [2020-02-10 19:43:40,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584184887] [2020-02-10 19:43:40,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,589 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 19:43:40,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584184887] [2020-02-10 19:43:40,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077855338] [2020-02-10 19:43:40,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,591 INFO L87 Difference]: Start difference. First operand 41 states and 74 transitions. Second operand 6 states. [2020-02-10 19:43:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,620 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2020-02-10 19:43:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,621 INFO L225 Difference]: With dead ends: 54 [2020-02-10 19:43:40,621 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 19:43:40,621 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 19:43:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 19:43:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-02-10 19:43:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 19:43:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-02-10 19:43:40,624 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2020-02-10 19:43:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,624 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2020-02-10 19:43:40,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2020-02-10 19:43:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,625 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1092957581, now seen corresponding path program 13 times [2020-02-10 19:43:40,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925373343] [2020-02-10 19:43:40,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,708 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 19:43:40,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925373343] [2020-02-10 19:43:40,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770905951] [2020-02-10 19:43:40,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,711 INFO L87 Difference]: Start difference. First operand 39 states and 71 transitions. Second operand 6 states. [2020-02-10 19:43:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,761 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-02-10 19:43:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,763 INFO L225 Difference]: With dead ends: 63 [2020-02-10 19:43:40,763 INFO L226 Difference]: Without dead ends: 56 [2020-02-10 19:43:40,764 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 19:43:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-02-10 19:43:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2020-02-10 19:43:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 19:43:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. [2020-02-10 19:43:40,767 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 13 [2020-02-10 19:43:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,767 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. [2020-02-10 19:43:40,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2020-02-10 19:43:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,768 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1035762383, now seen corresponding path program 14 times [2020-02-10 19:43:40,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985244928] [2020-02-10 19:43:40,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:40,890 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 19:43:40,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985244928] [2020-02-10 19:43:40,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:40,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:40,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96257952] [2020-02-10 19:43:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:40,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:40,893 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 6 states. [2020-02-10 19:43:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:40,925 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-02-10 19:43:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:40,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:40,926 INFO L225 Difference]: With dead ends: 66 [2020-02-10 19:43:40,926 INFO L226 Difference]: Without dead ends: 53 [2020-02-10 19:43:40,926 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 19:43:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-02-10 19:43:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-02-10 19:43:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-02-10 19:43:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-02-10 19:43:40,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 13 [2020-02-10 19:43:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:40,929 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-02-10 19:43:40,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-02-10 19:43:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:40,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:40,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:40,930 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash -237650927, now seen corresponding path program 15 times [2020-02-10 19:43:40,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:40,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972762525] [2020-02-10 19:43:40,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,028 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 19:43:41,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972762525] [2020-02-10 19:43:41,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:41,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704754419] [2020-02-10 19:43:41,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:41,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:41,030 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 6 states. [2020-02-10 19:43:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,083 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2020-02-10 19:43:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:41,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,084 INFO L225 Difference]: With dead ends: 54 [2020-02-10 19:43:41,085 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 19:43:41,085 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 19:43:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 19:43:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-02-10 19:43:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-02-10 19:43:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2020-02-10 19:43:41,091 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 13 [2020-02-10 19:43:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:41,091 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. [2020-02-10 19:43:41,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. [2020-02-10 19:43:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:41,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,093 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1484998923, now seen corresponding path program 16 times [2020-02-10 19:43:41,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298674361] [2020-02-10 19:43:41,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,238 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 19:43:41,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298674361] [2020-02-10 19:43:41,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:41,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687683633] [2020-02-10 19:43:41,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:41,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:41,240 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 6 states. [2020-02-10 19:43:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,280 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2020-02-10 19:43:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:41,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,282 INFO L225 Difference]: With dead ends: 47 [2020-02-10 19:43:41,282 INFO L226 Difference]: Without dead ends: 40 [2020-02-10 19:43:41,282 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 19:43:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-02-10 19:43:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2020-02-10 19:43:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 19:43:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2020-02-10 19:43:41,285 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2020-02-10 19:43:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:41,286 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2020-02-10 19:43:41,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2020-02-10 19:43:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:41,289 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,290 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -633260145, now seen corresponding path program 17 times [2020-02-10 19:43:41,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742069479] [2020-02-10 19:43:41,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,435 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 19:43:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742069479] [2020-02-10 19:43:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:41,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235370380] [2020-02-10 19:43:41,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:41,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:41,438 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand 6 states. [2020-02-10 19:43:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,476 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2020-02-10 19:43:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:41,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,477 INFO L225 Difference]: With dead ends: 52 [2020-02-10 19:43:41,478 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 19:43:41,478 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 19:43:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 19:43:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 19:43:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 19:43:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-02-10 19:43:41,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 13 [2020-02-10 19:43:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:41,556 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-02-10 19:43:41,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-02-10 19:43:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:41,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,557 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 225614385, now seen corresponding path program 18 times [2020-02-10 19:43:41,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111255702] [2020-02-10 19:43:41,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,684 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 19:43:41,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111255702] [2020-02-10 19:43:41,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:41,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912642123] [2020-02-10 19:43:41,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:41,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:41,686 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 6 states. [2020-02-10 19:43:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,717 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-02-10 19:43:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:41,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,718 INFO L225 Difference]: With dead ends: 41 [2020-02-10 19:43:41,718 INFO L226 Difference]: Without dead ends: 31 [2020-02-10 19:43:41,719 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 19:43:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-02-10 19:43:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-02-10 19:43:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 19:43:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-02-10 19:43:41,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2020-02-10 19:43:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:41,721 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-02-10 19:43:41,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-02-10 19:43:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:41,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,722 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1836921811, now seen corresponding path program 19 times [2020-02-10 19:43:41,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956777337] [2020-02-10 19:43:41,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:41,852 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 19:43:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956777337] [2020-02-10 19:43:41,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:41,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:41,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078267453] [2020-02-10 19:43:41,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:41,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:41,854 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-02-10 19:43:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:41,897 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-02-10 19:43:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:41,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:41,898 INFO L225 Difference]: With dead ends: 45 [2020-02-10 19:43:41,898 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 19:43:41,899 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 19:43:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 19:43:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-02-10 19:43:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 19:43:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-02-10 19:43:41,901 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2020-02-10 19:43:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:41,901 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-02-10 19:43:41,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-02-10 19:43:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:41,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:41,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:41,902 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:41,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1599170955, now seen corresponding path program 20 times [2020-02-10 19:43:41,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:41,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507544940] [2020-02-10 19:43:41,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,003 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 19:43:42,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507544940] [2020-02-10 19:43:42,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:42,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392797358] [2020-02-10 19:43:42,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:42,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:42,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:42,006 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 6 states. [2020-02-10 19:43:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,052 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-02-10 19:43:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:42,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,054 INFO L225 Difference]: With dead ends: 47 [2020-02-10 19:43:42,054 INFO L226 Difference]: Without dead ends: 32 [2020-02-10 19:43:42,054 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 19:43:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-02-10 19:43:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-02-10 19:43:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 19:43:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-02-10 19:43:42,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2020-02-10 19:43:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,057 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-02-10 19:43:42,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2020-02-10 19:43:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:42,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,058 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1602738831, now seen corresponding path program 21 times [2020-02-10 19:43:42,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57806421] [2020-02-10 19:43:42,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,161 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 19:43:42,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57806421] [2020-02-10 19:43:42,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:42,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117773194] [2020-02-10 19:43:42,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:42,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:42,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:42,163 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 6 states. [2020-02-10 19:43:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,200 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-02-10 19:43:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:42,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,201 INFO L225 Difference]: With dead ends: 37 [2020-02-10 19:43:42,201 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 19:43:42,202 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 19:43:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 19:43:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2020-02-10 19:43:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-02-10 19:43:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-02-10 19:43:42,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2020-02-10 19:43:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,205 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-02-10 19:43:42,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-02-10 19:43:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:42,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,205 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash 115010229, now seen corresponding path program 22 times [2020-02-10 19:43:42,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187068228] [2020-02-10 19:43:42,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,303 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 19:43:42,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187068228] [2020-02-10 19:43:42,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:42,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681816490] [2020-02-10 19:43:42,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:42,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:42,306 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 6 states. [2020-02-10 19:43:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,340 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-02-10 19:43:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:42,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,340 INFO L225 Difference]: With dead ends: 29 [2020-02-10 19:43:42,340 INFO L226 Difference]: Without dead ends: 22 [2020-02-10 19:43:42,341 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 19:43:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-02-10 19:43:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-02-10 19:43:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-02-10 19:43:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-02-10 19:43:42,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2020-02-10 19:43:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,342 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-02-10 19:43:42,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-02-10 19:43:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:42,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,343 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 111442353, now seen corresponding path program 23 times [2020-02-10 19:43:42,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519736145] [2020-02-10 19:43:42,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,453 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 19:43:42,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519736145] [2020-02-10 19:43:42,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:42,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493443978] [2020-02-10 19:43:42,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:42,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:42,456 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2020-02-10 19:43:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,501 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-02-10 19:43:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:42,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,502 INFO L225 Difference]: With dead ends: 27 [2020-02-10 19:43:42,502 INFO L226 Difference]: Without dead ends: 17 [2020-02-10 19:43:42,503 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 19:43:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-02-10 19:43:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-02-10 19:43:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-02-10 19:43:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-02-10 19:43:42,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2020-02-10 19:43:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,505 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-02-10 19:43:42,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-02-10 19:43:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 19:43:42,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:42,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:43:42,506 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 19:43:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash 970316883, now seen corresponding path program 24 times [2020-02-10 19:43:42,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:42,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058225910] [2020-02-10 19:43:42,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:42,622 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 19:43:42,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058225910] [2020-02-10 19:43:42,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:42,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 19:43:42,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284890600] [2020-02-10 19:43:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 19:43:42,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 19:43:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 19:43:42,624 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2020-02-10 19:43:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:42,655 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-02-10 19:43:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 19:43:42,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 19:43:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:42,656 INFO L225 Difference]: With dead ends: 16 [2020-02-10 19:43:42,656 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 19:43:42,656 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 19:43:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 19:43:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 19:43:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 19:43:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 19:43:42,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-02-10 19:43:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:42,657 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 19:43:42,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 19:43:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 19:43:42,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 19:43:42,661 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:43:42 BasicIcfg [2020-02-10 19:43:42,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:43:42,664 INFO L168 Benchmark]: Toolchain (without parser) took 5903.66 ms. Allocated memory was 140.0 MB in the beginning and 278.9 MB in the end (delta: 138.9 MB). Free memory was 120.6 MB in the beginning and 254.0 MB in the end (delta: -133.4 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2020-02-10 19:43:42,665 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 19:43:42,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.69 ms. Allocated memory is still 140.0 MB. Free memory was 120.4 MB in the beginning and 118.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 19:43:42,666 INFO L168 Benchmark]: Boogie Preprocessor took 14.04 ms. Allocated memory is still 140.0 MB. Free memory was 118.7 MB in the beginning and 117.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2020-02-10 19:43:42,666 INFO L168 Benchmark]: RCFGBuilder took 265.79 ms. Allocated memory is still 140.0 MB. Free memory was 117.7 MB in the beginning and 106.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-02-10 19:43:42,667 INFO L168 Benchmark]: TraceAbstraction took 5585.47 ms. Allocated memory was 140.0 MB in the beginning and 278.9 MB in the end (delta: 138.9 MB). Free memory was 106.2 MB in the beginning and 254.0 MB in the end (delta: -147.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-02-10 19:43:42,669 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 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 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 32.69 ms. Allocated memory is still 140.0 MB. Free memory was 120.4 MB in the beginning and 118.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 14.04 ms. Allocated memory is still 140.0 MB. Free memory was 118.7 MB in the beginning and 117.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 265.79 ms. Allocated memory is still 140.0 MB. Free memory was 117.7 MB in the beginning and 106.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5585.47 ms. Allocated memory was 140.0 MB in the beginning and 278.9 MB in the end (delta: 138.9 MB). Free memory was 106.2 MB in the beginning and 254.0 MB in the end (delta: -147.8 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.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 1.3s, 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, 3.0s 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 294 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s 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...