/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:12:43,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:12:43,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:12:43,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:12:43,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:12:43,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:12:43,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:12:43,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:12:43,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:12:43,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:12:43,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:12:43,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:12:43,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:12:43,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:12:43,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:12:43,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:12:43,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:12:43,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:12:43,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:12:43,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:12:43,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:12:43,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:12:43,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:12:43,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:12:43,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:12:43,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:12:43,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:12:43,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:12:43,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:12:43,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:12:43,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:12:43,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:12:43,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:12:43,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:12:43,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:12:43,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:12:43,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:12:43,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:12:43,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:12:43,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:12:43,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:12:43,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:12:43,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:12:43,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:12:43,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:12:43,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:12:43,646 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:12:43,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:12:43,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:12:43,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:12:43,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:12:43,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:12:43,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:12:43,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:12:43,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:12:43,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:12:43,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:12:43,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:12:43,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:12:43,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:12:43,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:12:43,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:12:43,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:12:43,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:43,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:12:43,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:12:43,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:12:43,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:12:43,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:12:43,650 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:12:43,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:12:43,651 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:12:43,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:12:43,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:12:43,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:12:43,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:12:43,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:12:43,937 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:12:43,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 15:12:44,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12638349/9f876f93109c4ac7974cb8f2169cfa3a/FLAG5969265d3 [2019-12-27 15:12:44,594 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:12:44,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-27 15:12:44,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12638349/9f876f93109c4ac7974cb8f2169cfa3a/FLAG5969265d3 [2019-12-27 15:12:44,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12638349/9f876f93109c4ac7974cb8f2169cfa3a [2019-12-27 15:12:44,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:12:44,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:12:44,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:44,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:12:44,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:12:44,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:44" (1/1) ... [2019-12-27 15:12:44,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7bb2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:44, skipping insertion in model container [2019-12-27 15:12:44,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:44" (1/1) ... [2019-12-27 15:12:44,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:12:44,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:12:45,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:45,401 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:12:45,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:45,552 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:12:45,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45 WrapperNode [2019-12-27 15:12:45,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:45,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:45,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:12:45,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:12:45,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:45,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:12:45,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:12:45,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:12:45,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... [2019-12-27 15:12:45,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:12:45,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:12:45,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:12:45,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:12:45,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:45,704 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 15:12:45,704 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 15:12:45,705 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 15:12:45,705 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 15:12:45,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:12:45,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:12:45,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:12:45,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:12:45,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:12:45,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:12:45,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:12:45,708 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:12:46,047 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:12:46,048 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 15:12:46,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:46 BoogieIcfgContainer [2019-12-27 15:12:46,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:12:46,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:12:46,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:12:46,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:12:46,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:12:44" (1/3) ... [2019-12-27 15:12:46,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7947037f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:46, skipping insertion in model container [2019-12-27 15:12:46,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:45" (2/3) ... [2019-12-27 15:12:46,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7947037f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:46, skipping insertion in model container [2019-12-27 15:12:46,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:46" (3/3) ... [2019-12-27 15:12:46,057 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-27 15:12:46,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:12:46,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:12:46,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 15:12:46,077 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:12:46,102 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,103 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,103 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,103 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,104 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,104 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,105 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,105 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,105 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,106 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,106 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,107 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,107 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,107 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,107 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,108 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,108 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,108 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,108 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,109 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,109 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,109 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,110 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,110 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,110 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,110 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,114 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,114 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,115 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,115 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,115 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,116 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,121 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,121 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,122 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,122 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,122 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,122 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:46,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 15:12:46,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:46,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:46,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:46,160 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:46,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:46,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:46,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:46,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:46,172 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 15:12:46,174 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 15:12:46,229 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 15:12:46,229 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:12:46,240 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 15:12:46,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 15:12:46,263 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 15:12:46,263 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:12:46,264 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 15:12:46,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 15:12:46,267 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:47,378 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 15:12:47,510 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 15:12:47,511 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 15:12:47,515 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 15:12:47,524 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 15:12:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 15:12:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:12:47,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:47,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:12:47,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 15:12:47,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:47,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542556018] [2019-12-27 15:12:47,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:47,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542556018] [2019-12-27 15:12:47,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:47,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:12:47,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [293349674] [2019-12-27 15:12:47,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:47,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:47,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:12:47,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:47,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:12:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:12:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:47,818 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 15:12:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:47,855 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 15:12:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:47,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:12:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:47,883 INFO L225 Difference]: With dead ends: 48 [2019-12-27 15:12:47,883 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:47,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 15:12:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 15:12:47,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 15:12:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:47,943 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 15:12:47,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:12:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 15:12:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 15:12:47,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:47,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:47,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 15:12:47,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:47,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149047203] [2019-12-27 15:12:47,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:48,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149047203] [2019-12-27 15:12:48,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:48,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:48,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557941006] [2019-12-27 15:12:48,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:48,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:48,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 15 transitions. [2019-12-27 15:12:48,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:48,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:48,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:48,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:48,084 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 15:12:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:48,109 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:48,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 15:12:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:48,111 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:48,112 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 15:12:48,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 15:12:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 15:12:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 15:12:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 15:12:48,123 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 15:12:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:48,124 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 15:12:48,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 15:12:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:12:48,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:48,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:48,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 15:12:48,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:48,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589746583] [2019-12-27 15:12:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:48,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589746583] [2019-12-27 15:12:48,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:48,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:12:48,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400705868] [2019-12-27 15:12:48,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:48,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:48,251 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 21 transitions. [2019-12-27 15:12:48,251 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:48,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:48,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:12:48,257 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 15:12:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:48,295 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:48,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 15:12:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:48,296 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:48,296 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:48,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 15:12:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 15:12:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 15:12:48,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 15:12:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:48,302 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 15:12:48,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 15:12:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:12:48,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:48,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:48,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 15:12:48,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:48,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331985507] [2019-12-27 15:12:48,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:48,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331985507] [2019-12-27 15:12:48,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:48,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:12:48,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550085558] [2019-12-27 15:12:48,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:48,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:48,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 17 transitions. [2019-12-27 15:12:48,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:48,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:48,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:48,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:12:48,361 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 15:12:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:48,410 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 15:12:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:48,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 15:12:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:48,412 INFO L225 Difference]: With dead ends: 32 [2019-12-27 15:12:48,412 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:48,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 15:12:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 15:12:48,417 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 15:12:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:48,417 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 15:12:48,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 15:12:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:48,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:48,418 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:48,419 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 15:12:48,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:48,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958693644] [2019-12-27 15:12:48,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:48,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958693644] [2019-12-27 15:12:48,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601159564] [2019-12-27 15:12:48,495 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:48,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 15:12:48,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:48,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:12:48,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:48,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:48,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 15:12:48,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684988106] [2019-12-27 15:12:48,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:48,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:48,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 22 transitions. [2019-12-27 15:12:48,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:48,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:48,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:12:48,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:12:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:48,603 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 6 states. [2019-12-27 15:12:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:48,710 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 15:12:48,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:48,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 15:12:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:48,711 INFO L225 Difference]: With dead ends: 32 [2019-12-27 15:12:48,711 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 15:12:48,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 15:12:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 15:12:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 15:12:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 15:12:48,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 15:12:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:48,716 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 15:12:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:12:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 15:12:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:48,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:48,717 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:48,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:48,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 15:12:48,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:48,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583654798] [2019-12-27 15:12:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583654798] [2019-12-27 15:12:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663232882] [2019-12-27 15:12:49,010 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:49,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:49,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:49,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:12:49,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:49,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 15:12:49,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365963991] [2019-12-27 15:12:49,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:49,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:49,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 18 transitions. [2019-12-27 15:12:49,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:49,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:49,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:12:49,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:49,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:12:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:49,095 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 6 states. [2019-12-27 15:12:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:49,175 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 15:12:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:12:49,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 15:12:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:49,177 INFO L225 Difference]: With dead ends: 33 [2019-12-27 15:12:49,177 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 15:12:49,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 15:12:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 15:12:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 15:12:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 15:12:49,186 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 15:12:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:49,187 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 15:12:49,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:12:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 15:12:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:12:49,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:49,188 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:49,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:49,393 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:49,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 15:12:49,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:49,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379009822] [2019-12-27 15:12:49,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379009822] [2019-12-27 15:12:49,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940402874] [2019-12-27 15:12:49,462 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:49,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:49,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:49,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 15:12:49,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:49,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 15:12:49,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632392155] [2019-12-27 15:12:49,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:49,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:49,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 23 transitions. [2019-12-27 15:12:49,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:49,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:49,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:49,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:49,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:49,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:49,538 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 7 states. [2019-12-27 15:12:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:49,612 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 15:12:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:12:49,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 15:12:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:49,614 INFO L225 Difference]: With dead ends: 34 [2019-12-27 15:12:49,614 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 15:12:49,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 15:12:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 15:12:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 15:12:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 15:12:49,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 15:12:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:49,619 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 15:12:49,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 15:12:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:12:49,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:49,620 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:49,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:49,830 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 15:12:49,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:49,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117484240] [2019-12-27 15:12:49,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117484240] [2019-12-27 15:12:49,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201609999] [2019-12-27 15:12:49,900 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:49,942 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 15:12:49,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:49,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:12:49,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:49,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:49,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 15:12:49,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382879933] [2019-12-27 15:12:49,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:49,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:49,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 19 transitions. [2019-12-27 15:12:49,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:49,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:49,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:49,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:49,975 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 7 states. [2019-12-27 15:12:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:50,063 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 15:12:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:50,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 15:12:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:50,065 INFO L225 Difference]: With dead ends: 35 [2019-12-27 15:12:50,065 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 15:12:50,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 15:12:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 15:12:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 15:12:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 15:12:50,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 15:12:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:50,069 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 15:12:50,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 15:12:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:12:50,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:50,070 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:50,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:50,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 15:12:50,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:50,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722573437] [2019-12-27 15:12:50,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:50,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722573437] [2019-12-27 15:12:50,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360009011] [2019-12-27 15:12:50,346 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:50,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:12:50,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:50,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:50,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 15:12:50,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1982475648] [2019-12-27 15:12:50,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:50,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:50,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 24 transitions. [2019-12-27 15:12:50,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:50,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:50,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:50,426 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 8 states. [2019-12-27 15:12:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:50,515 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 15:12:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:50,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 15:12:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:50,516 INFO L225 Difference]: With dead ends: 36 [2019-12-27 15:12:50,516 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 15:12:50,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 15:12:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 15:12:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 15:12:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 15:12:50,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 15:12:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:50,521 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 15:12:50,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 15:12:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 15:12:50,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:50,522 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:50,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:50,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 15:12:50,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:50,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066263738] [2019-12-27 15:12:50,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:50,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066263738] [2019-12-27 15:12:50,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468280372] [2019-12-27 15:12:50,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:50,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:50,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:50,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:12:50,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:50,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:50,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 15:12:50,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156181030] [2019-12-27 15:12:50,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:50,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:50,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 20 transitions. [2019-12-27 15:12:50,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:50,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:50,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:12:50,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:50,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:12:50,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:12:50,887 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 8 states. [2019-12-27 15:12:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:50,993 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 15:12:50,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:50,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 15:12:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:50,994 INFO L225 Difference]: With dead ends: 37 [2019-12-27 15:12:50,995 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 15:12:50,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 15:12:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 15:12:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 15:12:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 15:12:50,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 15:12:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:50,999 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 15:12:50,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:12:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 15:12:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:12:51,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:51,000 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:51,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,202 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 15:12:51,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:51,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924396361] [2019-12-27 15:12:51,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924396361] [2019-12-27 15:12:51,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421088789] [2019-12-27 15:12:51,278 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 15:12:51,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:51,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:12:51,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:51,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:51,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 15:12:51,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722616082] [2019-12-27 15:12:51,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:51,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:51,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 15:12:51,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:51,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:51,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:51,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:51,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:51,345 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 9 states. [2019-12-27 15:12:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:51,458 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 15:12:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:12:51,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 15:12:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:51,459 INFO L225 Difference]: With dead ends: 38 [2019-12-27 15:12:51,459 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 15:12:51,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 15:12:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 15:12:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 15:12:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 15:12:51,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 15:12:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:51,463 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 15:12:51,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 15:12:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:12:51,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:51,464 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:51,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 15:12:51,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:51,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508313710] [2019-12-27 15:12:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:51,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508313710] [2019-12-27 15:12:51,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993965910] [2019-12-27 15:12:51,753 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:51,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:51,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:12:51,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:51,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:51,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 15:12:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209133171] [2019-12-27 15:12:51,843 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:51,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:51,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 21 transitions. [2019-12-27 15:12:51,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:51,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:51,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:12:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:12:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:51,852 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 9 states. [2019-12-27 15:12:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:51,995 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 15:12:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:51,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 15:12:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:51,996 INFO L225 Difference]: With dead ends: 39 [2019-12-27 15:12:51,996 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 15:12:51,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 15:12:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 15:12:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 15:12:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 15:12:52,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 15:12:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:52,002 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 15:12:52,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:12:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 15:12:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:12:52,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:52,005 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:52,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,212 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 15:12:52,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410710104] [2019-12-27 15:12:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:52,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410710104] [2019-12-27 15:12:52,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734288820] [2019-12-27 15:12:52,297 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 15:12:52,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:52,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 15:12:52,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:52,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:52,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 15:12:52,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949319602] [2019-12-27 15:12:52,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:52,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:52,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 26 transitions. [2019-12-27 15:12:52,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:52,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:52,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:52,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:52,398 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 10 states. [2019-12-27 15:12:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:52,526 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 15:12:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:12:52,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 15:12:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:52,528 INFO L225 Difference]: With dead ends: 40 [2019-12-27 15:12:52,528 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 15:12:52,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:12:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 15:12:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 15:12:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 15:12:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 15:12:52,532 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 15:12:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:52,533 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 15:12:52,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 15:12:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:12:52,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:52,534 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:52,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,737 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 15:12:52,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:52,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808515403] [2019-12-27 15:12:52,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:52,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808515403] [2019-12-27 15:12:52,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503525008] [2019-12-27 15:12:52,823 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,890 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 15:12:52,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:52,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 15:12:52,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:52,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:52,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 15:12:52,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462161025] [2019-12-27 15:12:52,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:52,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:52,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 15:12:52,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:52,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:52,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:12:52,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:12:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:12:52,938 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 10 states. [2019-12-27 15:12:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:53,070 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 15:12:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:53,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 15:12:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:53,071 INFO L225 Difference]: With dead ends: 41 [2019-12-27 15:12:53,071 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 15:12:53,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:12:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 15:12:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 15:12:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 15:12:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 15:12:53,076 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 15:12:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:53,076 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 15:12:53,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:12:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 15:12:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:12:53,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:53,077 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:53,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,282 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:53,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 15:12:53,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:53,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267721634] [2019-12-27 15:12:53,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:53,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267721634] [2019-12-27 15:12:53,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694587714] [2019-12-27 15:12:53,354 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:53,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 15:12:53,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:53,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:53,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 15:12:53,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925926676] [2019-12-27 15:12:53,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:53,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:53,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 27 transitions. [2019-12-27 15:12:53,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:53,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:53,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:53,436 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 11 states. [2019-12-27 15:12:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:53,600 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 15:12:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:12:53,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 15:12:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:53,601 INFO L225 Difference]: With dead ends: 42 [2019-12-27 15:12:53,602 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 15:12:53,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:12:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 15:12:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 15:12:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 15:12:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 15:12:53,609 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 15:12:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:53,610 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 15:12:53,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 15:12:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:12:53,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:53,612 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:53,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 15:12:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443532560] [2019-12-27 15:12:53,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:53,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443532560] [2019-12-27 15:12:53,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691662051] [2019-12-27 15:12:53,941 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:53,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:53,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 15:12:53,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:54,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:54,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 15:12:54,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856087715] [2019-12-27 15:12:54,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:54,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:54,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 23 transitions. [2019-12-27 15:12:54,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:54,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:54,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:12:54,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:12:54,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:54,027 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 11 states. [2019-12-27 15:12:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:54,186 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 15:12:54,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:54,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 15:12:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:54,187 INFO L225 Difference]: With dead ends: 43 [2019-12-27 15:12:54,187 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 15:12:54,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:12:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 15:12:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 15:12:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 15:12:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 15:12:54,191 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 15:12:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:54,192 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 15:12:54,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:12:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 15:12:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:12:54,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:54,193 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:54,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:54,396 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 15:12:54,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:54,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784006562] [2019-12-27 15:12:54,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:54,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784006562] [2019-12-27 15:12:54,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49507631] [2019-12-27 15:12:54,523 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:54,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 15:12:54,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:54,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 15:12:54,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:54,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:54,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 15:12:54,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934794871] [2019-12-27 15:12:54,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:54,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:54,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 15:12:54,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:54,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:54,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:54,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:54,597 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 12 states. [2019-12-27 15:12:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:54,762 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 15:12:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:12:54,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 15:12:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:54,764 INFO L225 Difference]: With dead ends: 44 [2019-12-27 15:12:54,764 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 15:12:54,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:12:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 15:12:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 15:12:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 15:12:54,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 15:12:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:54,769 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 15:12:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 15:12:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:12:54,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:54,769 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:54,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:54,972 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 15:12:54,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:54,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857935309] [2019-12-27 15:12:54,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:55,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857935309] [2019-12-27 15:12:55,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942807517] [2019-12-27 15:12:55,054 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:55,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:55,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:55,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 15:12:55,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:55,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:55,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 15:12:55,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315909419] [2019-12-27 15:12:55,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:55,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:55,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 24 transitions. [2019-12-27 15:12:55,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:55,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:55,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:12:55,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:55,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:12:55,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:12:55,167 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 12 states. [2019-12-27 15:12:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:55,344 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 15:12:55,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:55,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 15:12:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:55,346 INFO L225 Difference]: With dead ends: 45 [2019-12-27 15:12:55,346 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 15:12:55,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:12:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 15:12:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 15:12:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 15:12:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 15:12:55,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 15:12:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:55,355 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 15:12:55,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:12:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 15:12:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:55,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:55,356 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:55,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:55,559 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 15:12:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:55,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703934349] [2019-12-27 15:12:55,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:55,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703934349] [2019-12-27 15:12:55,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174708059] [2019-12-27 15:12:55,663 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:55,721 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 15:12:55,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:55,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 15:12:55,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:55,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:55,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 15:12:55,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [516267322] [2019-12-27 15:12:55,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:55,750 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:55,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 29 transitions. [2019-12-27 15:12:55,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:55,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:55,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:12:55,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:55,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:12:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:55,755 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 13 states. [2019-12-27 15:12:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:55,966 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-27 15:12:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:12:55,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-27 15:12:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:55,967 INFO L225 Difference]: With dead ends: 46 [2019-12-27 15:12:55,967 INFO L226 Difference]: Without dead ends: 43 [2019-12-27 15:12:55,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:12:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-27 15:12:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-27 15:12:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-27 15:12:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-27 15:12:55,971 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-27 15:12:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:55,971 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-27 15:12:55,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:12:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-27 15:12:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:55,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:55,972 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:56,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:56,176 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-27 15:12:56,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:56,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469728618] [2019-12-27 15:12:56,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:56,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469728618] [2019-12-27 15:12:56,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812339803] [2019-12-27 15:12:56,261 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:56,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 15:12:56,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:56,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 15:12:56,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:56,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:56,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 15:12:56,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460422810] [2019-12-27 15:12:56,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:56,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:56,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 25 transitions. [2019-12-27 15:12:56,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:56,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:56,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:12:56,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:12:56,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:12:56,354 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 13 states. [2019-12-27 15:12:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:56,552 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-27 15:12:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:12:56,553 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-27 15:12:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:56,554 INFO L225 Difference]: With dead ends: 47 [2019-12-27 15:12:56,554 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 15:12:56,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:12:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 15:12:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 15:12:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 15:12:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 15:12:56,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-27 15:12:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:56,558 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 15:12:56,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:12:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 15:12:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:56,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:56,559 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:56,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:56,762 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-27 15:12:56,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:56,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142410229] [2019-12-27 15:12:56,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:56,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142410229] [2019-12-27 15:12:56,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473323566] [2019-12-27 15:12:56,884 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:56,945 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 15:12:56,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:56,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:56,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 15:12:56,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324041204] [2019-12-27 15:12:56,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:56,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:56,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 30 transitions. [2019-12-27 15:12:56,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:56,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:56,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:12:56,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:56,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:12:56,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:56,974 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 14 states. [2019-12-27 15:12:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:57,157 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-27 15:12:57,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:12:57,158 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-27 15:12:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:57,159 INFO L225 Difference]: With dead ends: 48 [2019-12-27 15:12:57,159 INFO L226 Difference]: Without dead ends: 45 [2019-12-27 15:12:57,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:12:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-27 15:12:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-27 15:12:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 15:12:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 15:12:57,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-27 15:12:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:57,163 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 15:12:57,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:12:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 15:12:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 15:12:57,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:57,164 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:57,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:57,368 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-27 15:12:57,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:57,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825163591] [2019-12-27 15:12:57,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:57,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825163591] [2019-12-27 15:12:57,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864616289] [2019-12-27 15:12:57,506 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:57,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:12:57,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:57,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 15:12:57,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:57,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:57,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 15:12:57,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060804781] [2019-12-27 15:12:57,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:57,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:57,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 26 transitions. [2019-12-27 15:12:57,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:57,581 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:57,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:12:57,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:12:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:12:57,582 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 14 states. [2019-12-27 15:12:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:57,787 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-27 15:12:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:12:57,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-27 15:12:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:57,788 INFO L225 Difference]: With dead ends: 49 [2019-12-27 15:12:57,788 INFO L226 Difference]: Without dead ends: 46 [2019-12-27 15:12:57,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:12:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-27 15:12:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-27 15:12:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 15:12:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 15:12:57,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-27 15:12:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:57,798 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 15:12:57,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:12:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 15:12:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:12:57,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:57,799 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:58,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:58,003 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-27 15:12:58,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:58,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872336117] [2019-12-27 15:12:58,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:58,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872336117] [2019-12-27 15:12:58,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144427277] [2019-12-27 15:12:58,127 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:58,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 15:12:58,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:58,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 15:12:58,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:58,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:58,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 15:12:58,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [618126604] [2019-12-27 15:12:58,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:58,228 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:58,234 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 15:12:58,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:58,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:12:58,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:12:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:58,239 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 15 states. [2019-12-27 15:12:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:58,480 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-27 15:12:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:12:58,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 15:12:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:58,482 INFO L225 Difference]: With dead ends: 50 [2019-12-27 15:12:58,482 INFO L226 Difference]: Without dead ends: 47 [2019-12-27 15:12:58,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:12:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-27 15:12:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-27 15:12:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 15:12:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-27 15:12:58,485 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-27 15:12:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:58,485 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-27 15:12:58,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:12:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-27 15:12:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:12:58,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:58,486 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:58,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:58,690 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-27 15:12:58,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:58,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059661085] [2019-12-27 15:12:58,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:58,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059661085] [2019-12-27 15:12:58,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326544810] [2019-12-27 15:12:58,824 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:58,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:12:58,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:58,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 15:12:58,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:58,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:58,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 15:12:58,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905873552] [2019-12-27 15:12:58,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:58,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:58,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 15:12:58,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:58,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:12:58,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:12:58,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:12:58,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:12:58,912 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 15 states. [2019-12-27 15:12:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:59,170 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-27 15:12:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:12:59,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 15:12:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:59,171 INFO L225 Difference]: With dead ends: 51 [2019-12-27 15:12:59,171 INFO L226 Difference]: Without dead ends: 48 [2019-12-27 15:12:59,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:12:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-27 15:12:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-27 15:12:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 15:12:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 15:12:59,174 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-27 15:12:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:59,175 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 15:12:59,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:12:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 15:12:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:59,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:59,175 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:59,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:59,380 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-27 15:12:59,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:59,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371484514] [2019-12-27 15:12:59,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:59,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371484514] [2019-12-27 15:12:59,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598526478] [2019-12-27 15:12:59,506 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:59,555 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 15:12:59,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:12:59,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 15:12:59,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:59,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:59,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 15:12:59,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696436102] [2019-12-27 15:12:59,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:59,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:59,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 32 transitions. [2019-12-27 15:12:59,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:59,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:59,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:12:59,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:12:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:12:59,598 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 16 states. [2019-12-27 15:12:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:59,842 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-27 15:12:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:12:59,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-27 15:12:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:59,843 INFO L225 Difference]: With dead ends: 52 [2019-12-27 15:12:59,843 INFO L226 Difference]: Without dead ends: 49 [2019-12-27 15:12:59,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=550, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:12:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-27 15:12:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-27 15:12:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 15:12:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 15:12:59,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-27 15:12:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:59,847 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 15:12:59,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:12:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 15:12:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:12:59,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:59,848 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:00,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:00,049 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-27 15:13:00,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:00,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368310220] [2019-12-27 15:13:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:00,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368310220] [2019-12-27 15:13:00,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968319399] [2019-12-27 15:13:00,182 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:00,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 15:13:00,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:00,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 15:13:00,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:00,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:00,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 15:13:00,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828754256] [2019-12-27 15:13:00,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:00,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:00,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 28 transitions. [2019-12-27 15:13:00,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:00,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:00,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:13:00,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:13:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:13:00,268 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 16 states. [2019-12-27 15:13:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:00,533 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-27 15:13:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 15:13:00,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-27 15:13:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:00,534 INFO L225 Difference]: With dead ends: 53 [2019-12-27 15:13:00,534 INFO L226 Difference]: Without dead ends: 50 [2019-12-27 15:13:00,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:13:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-27 15:13:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-27 15:13:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 15:13:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 15:13:00,538 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-27 15:13:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:00,538 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 15:13:00,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:13:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 15:13:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:13:00,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:00,539 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:00,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:00,740 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-27 15:13:00,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:00,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801714640] [2019-12-27 15:13:00,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:00,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801714640] [2019-12-27 15:13:00,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449449047] [2019-12-27 15:13:00,860 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:00,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 15:13:00,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:00,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:00,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 15:13:00,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905447556] [2019-12-27 15:13:00,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:00,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:00,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 15:13:00,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:00,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:00,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 15:13:00,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 15:13:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:13:00,944 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 17 states. [2019-12-27 15:13:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:01,228 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-27 15:13:01,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 15:13:01,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 15:13:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:01,229 INFO L225 Difference]: With dead ends: 54 [2019-12-27 15:13:01,230 INFO L226 Difference]: Without dead ends: 51 [2019-12-27 15:13:01,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=631, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:13:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-27 15:13:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-27 15:13:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-27 15:13:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-27 15:13:01,233 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-27 15:13:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:01,233 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-27 15:13:01,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 15:13:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-27 15:13:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 15:13:01,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:01,234 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:01,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:01,438 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-27 15:13:01,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:01,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191306826] [2019-12-27 15:13:01,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191306826] [2019-12-27 15:13:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008166473] [2019-12-27 15:13:01,565 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:01,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:01,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:01,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 15:13:01,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:01,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:01,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 15:13:01,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609043437] [2019-12-27 15:13:01,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:01,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:01,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 15:13:01,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:01,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:01,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 15:13:01,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:01,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 15:13:01,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:13:01,646 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 17 states. [2019-12-27 15:13:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:01,980 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-27 15:13:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:13:01,981 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 15:13:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:01,982 INFO L225 Difference]: With dead ends: 55 [2019-12-27 15:13:01,982 INFO L226 Difference]: Without dead ends: 52 [2019-12-27 15:13:01,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2019-12-27 15:13:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-27 15:13:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-27 15:13:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 15:13:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 15:13:01,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-27 15:13:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:01,986 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 15:13:01,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 15:13:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 15:13:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:13:01,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:01,987 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:02,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:02,189 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-27 15:13:02,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:02,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566106874] [2019-12-27 15:13:02,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:02,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566106874] [2019-12-27 15:13:02,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251791297] [2019-12-27 15:13:02,321 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:02,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 15:13:02,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:02,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 15:13:02,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:02,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:02,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 15:13:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224984116] [2019-12-27 15:13:02,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:02,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:02,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 34 transitions. [2019-12-27 15:13:02,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:02,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:02,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:13:02,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:02,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:13:02,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:13:02,409 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 18 states. [2019-12-27 15:13:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:02,717 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-27 15:13:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:13:02,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-27 15:13:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:02,718 INFO L225 Difference]: With dead ends: 56 [2019-12-27 15:13:02,718 INFO L226 Difference]: Without dead ends: 53 [2019-12-27 15:13:02,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=717, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:13:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-27 15:13:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-27 15:13:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 15:13:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 15:13:02,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-27 15:13:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:02,722 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 15:13:02,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:13:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 15:13:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:13:02,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:02,722 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:02,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:02,926 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-27 15:13:02,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:02,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050655627] [2019-12-27 15:13:02,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:03,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050655627] [2019-12-27 15:13:03,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003271874] [2019-12-27 15:13:03,070 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:03,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:03,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:03,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 15:13:03,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:03,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:03,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 15:13:03,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550941558] [2019-12-27 15:13:03,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:03,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:03,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 15:13:03,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:03,158 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:03,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:13:03,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:13:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:13:03,159 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 18 states. [2019-12-27 15:13:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:03,493 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-27 15:13:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:13:03,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-27 15:13:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:03,498 INFO L225 Difference]: With dead ends: 57 [2019-12-27 15:13:03,498 INFO L226 Difference]: Without dead ends: 54 [2019-12-27 15:13:03,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 15:13:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-27 15:13:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-27 15:13:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 15:13:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 15:13:03,501 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-27 15:13:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:03,501 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 15:13:03,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:13:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 15:13:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:13:03,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:03,502 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:03,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:03,703 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-27 15:13:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:03,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586109051] [2019-12-27 15:13:03,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:03,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586109051] [2019-12-27 15:13:03,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200321891] [2019-12-27 15:13:03,897 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:03,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-27 15:13:03,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:03,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 15:13:03,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:03,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:03,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 15:13:03,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991583722] [2019-12-27 15:13:03,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:03,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:03,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 35 transitions. [2019-12-27 15:13:03,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:03,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:03,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 15:13:03,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:03,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 15:13:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:13:03,981 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 19 states. [2019-12-27 15:13:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:04,303 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-27 15:13:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:13:04,308 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-27 15:13:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:04,309 INFO L225 Difference]: With dead ends: 58 [2019-12-27 15:13:04,309 INFO L226 Difference]: Without dead ends: 55 [2019-12-27 15:13:04,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=809, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:13:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-27 15:13:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-27 15:13:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 15:13:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-27 15:13:04,311 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-27 15:13:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:04,312 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-27 15:13:04,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 15:13:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-27 15:13:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:13:04,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:04,312 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:04,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:04,516 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-27 15:13:04,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:04,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398835943] [2019-12-27 15:13:04,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:04,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398835943] [2019-12-27 15:13:04,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098230770] [2019-12-27 15:13:04,701 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:04,762 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 15:13:04,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:04,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 15:13:04,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:04,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:04,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 15:13:04,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94100370] [2019-12-27 15:13:04,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:04,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:04,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 31 transitions. [2019-12-27 15:13:04,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:04,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:04,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 15:13:04,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 15:13:04,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:13:04,789 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 19 states. [2019-12-27 15:13:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:05,146 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-27 15:13:05,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:13:05,148 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-27 15:13:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:05,149 INFO L225 Difference]: With dead ends: 59 [2019-12-27 15:13:05,149 INFO L226 Difference]: Without dead ends: 56 [2019-12-27 15:13:05,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=847, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:13:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-27 15:13:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-27 15:13:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 15:13:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 15:13:05,152 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-27 15:13:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:05,153 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 15:13:05,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 15:13:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 15:13:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:13:05,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:05,154 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:05,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:05,357 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-27 15:13:05,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:05,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713778704] [2019-12-27 15:13:05,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713778704] [2019-12-27 15:13:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827082808] [2019-12-27 15:13:05,559 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:05,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 15:13:05,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:05,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:05,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 15:13:05,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990750380] [2019-12-27 15:13:05,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:05,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:05,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 36 transitions. [2019-12-27 15:13:05,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:05,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:05,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 15:13:05,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 15:13:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:13:05,648 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 20 states. [2019-12-27 15:13:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:06,020 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-27 15:13:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:13:06,020 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-12-27 15:13:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:06,021 INFO L225 Difference]: With dead ends: 60 [2019-12-27 15:13:06,021 INFO L226 Difference]: Without dead ends: 57 [2019-12-27 15:13:06,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=426, Invalid=906, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 15:13:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-27 15:13:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-27 15:13:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 15:13:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 15:13:06,027 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-27 15:13:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:06,027 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 15:13:06,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 15:13:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 15:13:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 15:13:06,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:06,028 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:06,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:06,231 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-27 15:13:06,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:06,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393904925] [2019-12-27 15:13:06,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393904925] [2019-12-27 15:13:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836258051] [2019-12-27 15:13:06,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:06,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:06,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:06,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 15:13:06,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:06,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:06,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 15:13:06,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161737690] [2019-12-27 15:13:06,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:06,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:06,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 32 transitions. [2019-12-27 15:13:06,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:06,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:06,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 15:13:06,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 15:13:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:13:06,469 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 20 states. [2019-12-27 15:13:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:06,857 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-27 15:13:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:13:06,858 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-12-27 15:13:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:06,858 INFO L225 Difference]: With dead ends: 61 [2019-12-27 15:13:06,859 INFO L226 Difference]: Without dead ends: 58 [2019-12-27 15:13:06,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=460, Invalid=946, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 15:13:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-27 15:13:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-27 15:13:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 15:13:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 15:13:06,861 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-27 15:13:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:06,862 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 15:13:06,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 15:13:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 15:13:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:13:06,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:06,862 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:07,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,066 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-27 15:13:07,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687985850] [2019-12-27 15:13:07,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:07,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687985850] [2019-12-27 15:13:07,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209071759] [2019-12-27 15:13:07,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 15:13:07,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:07,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 15:13:07,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:07,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:07,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 15:13:07,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055117045] [2019-12-27 15:13:07,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:07,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:07,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 37 transitions. [2019-12-27 15:13:07,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:07,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:07,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 15:13:07,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 15:13:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:13:07,367 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 21 states. [2019-12-27 15:13:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:07,820 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-27 15:13:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:13:07,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 15:13:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:07,821 INFO L225 Difference]: With dead ends: 62 [2019-12-27 15:13:07,821 INFO L226 Difference]: Without dead ends: 59 [2019-12-27 15:13:07,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=473, Invalid=1009, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:13:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-27 15:13:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-27 15:13:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-27 15:13:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-27 15:13:07,824 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-27 15:13:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:07,824 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-27 15:13:07,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 15:13:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-27 15:13:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:13:07,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:07,825 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:08,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:08,028 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-27 15:13:08,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992597928] [2019-12-27 15:13:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:08,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992597928] [2019-12-27 15:13:08,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740965492] [2019-12-27 15:13:08,260 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:08,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:08,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:08,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 15:13:08,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:08,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:08,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 15:13:08,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216375057] [2019-12-27 15:13:08,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 33 transitions. [2019-12-27 15:13:08,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:08,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 15:13:08,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 15:13:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:13:08,386 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 21 states. [2019-12-27 15:13:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,853 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-27 15:13:08,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:13:08,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 15:13:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,854 INFO L225 Difference]: With dead ends: 63 [2019-12-27 15:13:08,854 INFO L226 Difference]: Without dead ends: 60 [2019-12-27 15:13:08,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=1051, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 15:13:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-27 15:13:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-27 15:13:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-27 15:13:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-27 15:13:08,857 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-27 15:13:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,857 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-27 15:13:08,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 15:13:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-27 15:13:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:13:08,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,858 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:09,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:09,062 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-27 15:13:09,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:09,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537729993] [2019-12-27 15:13:09,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:09,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537729993] [2019-12-27 15:13:09,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920930942] [2019-12-27 15:13:09,277 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:09,351 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 15:13:09,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:09,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 15:13:09,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:09,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:09,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 15:13:09,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257954471] [2019-12-27 15:13:09,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:09,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:09,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 38 transitions. [2019-12-27 15:13:09,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:09,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:09,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 15:13:09,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:09,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 15:13:09,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:13:09,390 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 22 states. [2019-12-27 15:13:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:09,805 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-27 15:13:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:13:09,806 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-12-27 15:13:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:09,807 INFO L225 Difference]: With dead ends: 64 [2019-12-27 15:13:09,807 INFO L226 Difference]: Without dead ends: 61 [2019-12-27 15:13:09,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=523, Invalid=1117, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:13:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-27 15:13:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-27 15:13:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 15:13:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 15:13:09,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-27 15:13:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:09,812 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 15:13:09,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 15:13:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 15:13:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:13:09,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:09,812 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:10,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:10,016 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-27 15:13:10,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:10,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82860742] [2019-12-27 15:13:10,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:10,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82860742] [2019-12-27 15:13:10,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37137092] [2019-12-27 15:13:10,193 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:10,249 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-27 15:13:10,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:10,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 15:13:10,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:10,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:10,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 15:13:10,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287736811] [2019-12-27 15:13:10,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:10,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:10,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 34 transitions. [2019-12-27 15:13:10,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:10,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:10,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 15:13:10,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 15:13:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:13:10,294 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 22 states. [2019-12-27 15:13:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:10,757 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-27 15:13:10,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:13:10,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-12-27 15:13:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:10,758 INFO L225 Difference]: With dead ends: 65 [2019-12-27 15:13:10,758 INFO L226 Difference]: Without dead ends: 62 [2019-12-27 15:13:10,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:13:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-27 15:13:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-27 15:13:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 15:13:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-27 15:13:10,762 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-27 15:13:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:10,762 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-27 15:13:10,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 15:13:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-27 15:13:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:13:10,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:10,762 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:10,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:10,963 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-27 15:13:10,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:10,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672506663] [2019-12-27 15:13:10,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:11,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672506663] [2019-12-27 15:13:11,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831398158] [2019-12-27 15:13:11,191 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:11,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 15:13:11,253 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:11,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:11,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 15:13:11,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677023024] [2019-12-27 15:13:11,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:11,280 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:11,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 39 transitions. [2019-12-27 15:13:11,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:11,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:11,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 15:13:11,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:11,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 15:13:11,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:13:11,289 INFO L87 Difference]: Start difference. First operand 62 states and 126 transitions. Second operand 23 states. [2019-12-27 15:13:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:11,756 INFO L93 Difference]: Finished difference Result 66 states and 134 transitions. [2019-12-27 15:13:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:13:11,756 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-12-27 15:13:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:11,757 INFO L225 Difference]: With dead ends: 66 [2019-12-27 15:13:11,757 INFO L226 Difference]: Without dead ends: 63 [2019-12-27 15:13:11,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=1231, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 15:13:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-27 15:13:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-12-27 15:13:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-27 15:13:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-27 15:13:11,763 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 27 [2019-12-27 15:13:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:11,763 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-27 15:13:11,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 15:13:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-27 15:13:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:13:11,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:11,763 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:11,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:11,964 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -698357774, now seen corresponding path program 38 times [2019-12-27 15:13:11,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:11,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986096932] [2019-12-27 15:13:11,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:12,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986096932] [2019-12-27 15:13:12,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48971182] [2019-12-27 15:13:12,166 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:12,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:12,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:12,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 15:13:12,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:12,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:12,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 15:13:12,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582792260] [2019-12-27 15:13:12,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:12,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:12,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 35 transitions. [2019-12-27 15:13:12,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:12,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:12,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 15:13:12,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 15:13:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:13:12,260 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 23 states. [2019-12-27 15:13:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:12,694 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2019-12-27 15:13:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:13:12,695 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-12-27 15:13:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:12,696 INFO L225 Difference]: With dead ends: 67 [2019-12-27 15:13:12,696 INFO L226 Difference]: Without dead ends: 64 [2019-12-27 15:13:12,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=615, Invalid=1277, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 15:13:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-27 15:13:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-27 15:13:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-27 15:13:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 130 transitions. [2019-12-27 15:13:12,700 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 130 transitions. Word has length 27 [2019-12-27 15:13:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:12,700 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 130 transitions. [2019-12-27 15:13:12,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 15:13:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 130 transitions. [2019-12-27 15:13:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:13:12,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:12,701 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:12,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:12,905 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1697011851, now seen corresponding path program 39 times [2019-12-27 15:13:12,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:12,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244749791] [2019-12-27 15:13:12,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:13,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244749791] [2019-12-27 15:13:13,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698957564] [2019-12-27 15:13:13,120 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:13,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-27 15:13:13,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:13,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 15:13:13,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:13,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:13,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 15:13:13,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557001393] [2019-12-27 15:13:13,211 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:13,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:13,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 15:13:13,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:13,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:13,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 15:13:13,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 15:13:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:13:13,223 INFO L87 Difference]: Start difference. First operand 64 states and 130 transitions. Second operand 24 states. [2019-12-27 15:13:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:13,746 INFO L93 Difference]: Finished difference Result 68 states and 138 transitions. [2019-12-27 15:13:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:13:13,746 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-12-27 15:13:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:13,747 INFO L225 Difference]: With dead ends: 68 [2019-12-27 15:13:13,748 INFO L226 Difference]: Without dead ends: 65 [2019-12-27 15:13:13,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=1350, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 15:13:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-27 15:13:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-12-27 15:13:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 15:13:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 15:13:13,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 28 [2019-12-27 15:13:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 15:13:13,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 15:13:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 15:13:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:13:13,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:13,752 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:13,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:13,953 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -174254209, now seen corresponding path program 40 times [2019-12-27 15:13:13,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:13,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167550424] [2019-12-27 15:13:13,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:14,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167550424] [2019-12-27 15:13:14,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507026776] [2019-12-27 15:13:14,179 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:14,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:14,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:14,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 15:13:14,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:14,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:14,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 15:13:14,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454139903] [2019-12-27 15:13:14,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:14,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:14,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 36 transitions. [2019-12-27 15:13:14,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:14,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:14,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 15:13:14,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 15:13:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:13:14,273 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 24 states. [2019-12-27 15:13:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:14,766 INFO L93 Difference]: Finished difference Result 69 states and 140 transitions. [2019-12-27 15:13:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:13:14,766 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-12-27 15:13:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:14,767 INFO L225 Difference]: With dead ends: 69 [2019-12-27 15:13:14,767 INFO L226 Difference]: Without dead ends: 66 [2019-12-27 15:13:14,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=672, Invalid=1398, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 15:13:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-27 15:13:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-27 15:13:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-27 15:13:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-27 15:13:14,772 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 28 [2019-12-27 15:13:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:14,772 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-27 15:13:14,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 15:13:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-27 15:13:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:13:14,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:14,774 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:14,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:14,978 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1067760134, now seen corresponding path program 41 times [2019-12-27 15:13:14,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:14,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628480745] [2019-12-27 15:13:14,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:15,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628480745] [2019-12-27 15:13:15,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725770536] [2019-12-27 15:13:15,199 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:15,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-27 15:13:15,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:15,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 15:13:15,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:15,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 15:13:15,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123372172] [2019-12-27 15:13:15,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:15,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:15,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 41 transitions. [2019-12-27 15:13:15,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:15,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:15,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 15:13:15,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:15,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 15:13:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:13:15,303 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 25 states. [2019-12-27 15:13:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:15,847 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2019-12-27 15:13:15,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:13:15,847 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-12-27 15:13:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:15,848 INFO L225 Difference]: With dead ends: 70 [2019-12-27 15:13:15,848 INFO L226 Difference]: Without dead ends: 67 [2019-12-27 15:13:15,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=687, Invalid=1475, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 15:13:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-27 15:13:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2019-12-27 15:13:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-27 15:13:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 84 transitions. [2019-12-27 15:13:15,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 84 transitions. Word has length 29 [2019-12-27 15:13:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:15,853 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 84 transitions. [2019-12-27 15:13:15,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 15:13:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 84 transitions. [2019-12-27 15:13:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:13:15,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:15,853 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:16,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:16,057 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1106913126, now seen corresponding path program 42 times [2019-12-27 15:13:16,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:16,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031956262] [2019-12-27 15:13:16,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031956262] [2019-12-27 15:13:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028300839] [2019-12-27 15:13:16,312 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:16,372 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-27 15:13:16,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:16,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 15:13:16,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:16,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:16,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 15:13:16,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [761064834] [2019-12-27 15:13:16,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:16,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:16,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 37 transitions. [2019-12-27 15:13:16,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:16,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:16,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 15:13:16,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 15:13:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:13:16,404 INFO L87 Difference]: Start difference. First operand 41 states and 84 transitions. Second operand 25 states. [2019-12-27 15:13:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:17,003 INFO L93 Difference]: Finished difference Result 71 states and 144 transitions. [2019-12-27 15:13:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:13:17,004 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-12-27 15:13:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:17,005 INFO L225 Difference]: With dead ends: 71 [2019-12-27 15:13:17,005 INFO L226 Difference]: Without dead ends: 68 [2019-12-27 15:13:17,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=731, Invalid=1525, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 15:13:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-27 15:13:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-27 15:13:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-27 15:13:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 138 transitions. [2019-12-27 15:13:17,010 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 138 transitions. Word has length 29 [2019-12-27 15:13:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:17,010 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 138 transitions. [2019-12-27 15:13:17,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 15:13:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 138 transitions. [2019-12-27 15:13:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 15:13:17,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:17,011 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:17,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:17,212 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1259174157, now seen corresponding path program 43 times [2019-12-27 15:13:17,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:17,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289079841] [2019-12-27 15:13:17,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:17,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289079841] [2019-12-27 15:13:17,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954582543] [2019-12-27 15:13:17,639 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:17,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 15:13:17,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:17,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:17,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 15:13:17,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788018806] [2019-12-27 15:13:17,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:17,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:17,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 42 transitions. [2019-12-27 15:13:17,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:17,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:17,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 15:13:17,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 15:13:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:13:17,785 INFO L87 Difference]: Start difference. First operand 68 states and 138 transitions. Second operand 26 states. [2019-12-27 15:13:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:18,341 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2019-12-27 15:13:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:13:18,341 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-12-27 15:13:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:18,342 INFO L225 Difference]: With dead ends: 72 [2019-12-27 15:13:18,342 INFO L226 Difference]: Without dead ends: 69 [2019-12-27 15:13:18,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=747, Invalid=1605, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 15:13:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-27 15:13:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-12-27 15:13:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 15:13:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 15:13:18,346 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 30 [2019-12-27 15:13:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:18,346 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 15:13:18,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 15:13:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 15:13:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 15:13:18,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:18,347 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:18,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:18,550 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 45431767, now seen corresponding path program 44 times [2019-12-27 15:13:18,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:18,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078302203] [2019-12-27 15:13:18,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:18,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078302203] [2019-12-27 15:13:18,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458078065] [2019-12-27 15:13:18,800 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:18,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:18,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:18,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 15:13:18,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:18,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:18,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 15:13:18,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [457560794] [2019-12-27 15:13:18,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:18,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:18,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 38 transitions. [2019-12-27 15:13:18,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:18,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:18,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 15:13:18,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:18,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 15:13:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:13:18,918 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 26 states. [2019-12-27 15:13:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:19,484 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-27 15:13:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:13:19,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-12-27 15:13:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:19,485 INFO L225 Difference]: With dead ends: 73 [2019-12-27 15:13:19,485 INFO L226 Difference]: Without dead ends: 70 [2019-12-27 15:13:19,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 15:13:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-27 15:13:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-27 15:13:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-27 15:13:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2019-12-27 15:13:19,490 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 30 [2019-12-27 15:13:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:19,490 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2019-12-27 15:13:19,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 15:13:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2019-12-27 15:13:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:13:19,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:19,491 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:19,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:19,694 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash -379692898, now seen corresponding path program 45 times [2019-12-27 15:13:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:19,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624223903] [2019-12-27 15:13:19,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:19,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624223903] [2019-12-27 15:13:19,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571022033] [2019-12-27 15:13:19,935 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:19,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-27 15:13:19,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:19,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 15:13:19,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:20,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:20,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 15:13:20,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339671441] [2019-12-27 15:13:20,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:20,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:20,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 43 transitions. [2019-12-27 15:13:20,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:20,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:20,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 15:13:20,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:20,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 15:13:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:13:20,036 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand 27 states. [2019-12-27 15:13:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:20,612 INFO L93 Difference]: Finished difference Result 74 states and 150 transitions. [2019-12-27 15:13:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:13:20,613 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2019-12-27 15:13:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:20,614 INFO L225 Difference]: With dead ends: 74 [2019-12-27 15:13:20,614 INFO L226 Difference]: Without dead ends: 71 [2019-12-27 15:13:20,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=809, Invalid=1741, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 15:13:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-27 15:13:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2019-12-27 15:13:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-27 15:13:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 88 transitions. [2019-12-27 15:13:20,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 88 transitions. Word has length 31 [2019-12-27 15:13:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:20,618 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 88 transitions. [2019-12-27 15:13:20,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 15:13:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 88 transitions. [2019-12-27 15:13:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:13:20,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:20,619 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:20,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:20,822 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1408384834, now seen corresponding path program 46 times [2019-12-27 15:13:20,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:20,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182871395] [2019-12-27 15:13:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:21,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182871395] [2019-12-27 15:13:21,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311508631] [2019-12-27 15:13:21,076 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:21,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:21,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:21,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 15:13:21,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:21,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:21,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 15:13:21,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533408799] [2019-12-27 15:13:21,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:21,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:21,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 39 transitions. [2019-12-27 15:13:21,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:21,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:21,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 15:13:21,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 15:13:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:13:21,202 INFO L87 Difference]: Start difference. First operand 43 states and 88 transitions. Second operand 27 states. [2019-12-27 15:13:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:21,776 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-27 15:13:21,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 15:13:21,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2019-12-27 15:13:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:21,783 INFO L225 Difference]: With dead ends: 75 [2019-12-27 15:13:21,783 INFO L226 Difference]: Without dead ends: 72 [2019-12-27 15:13:21,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=857, Invalid=1795, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 15:13:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-27 15:13:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-27 15:13:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-27 15:13:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2019-12-27 15:13:21,787 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 31 [2019-12-27 15:13:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:21,787 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2019-12-27 15:13:21,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 15:13:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2019-12-27 15:13:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 15:13:21,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:21,788 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:21,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:21,988 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1114422107, now seen corresponding path program 47 times [2019-12-27 15:13:21,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:21,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640823771] [2019-12-27 15:13:21,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:22,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640823771] [2019-12-27 15:13:22,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191248473] [2019-12-27 15:13:22,260 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:22,319 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-27 15:13:22,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:22,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 15:13:22,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:22,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:22,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 15:13:22,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1289264612] [2019-12-27 15:13:22,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:22,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:22,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 44 transitions. [2019-12-27 15:13:22,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:22,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 15:13:22,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 15:13:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:13:22,364 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand 28 states. [2019-12-27 15:13:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:22,968 INFO L93 Difference]: Finished difference Result 76 states and 154 transitions. [2019-12-27 15:13:22,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 15:13:22,968 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-12-27 15:13:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:22,969 INFO L225 Difference]: With dead ends: 76 [2019-12-27 15:13:22,969 INFO L226 Difference]: Without dead ends: 73 [2019-12-27 15:13:22,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=874, Invalid=1882, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 15:13:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-27 15:13:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-12-27 15:13:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 15:13:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 15:13:22,973 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 32 [2019-12-27 15:13:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:22,973 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 15:13:22,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 15:13:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 15:13:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 15:13:22,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:22,974 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:23,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:23,177 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash 710257199, now seen corresponding path program 48 times [2019-12-27 15:13:23,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:23,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817462354] [2019-12-27 15:13:23,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:23,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817462354] [2019-12-27 15:13:23,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221927183] [2019-12-27 15:13:23,450 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:23,522 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-27 15:13:23,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:23,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 15:13:23,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:23,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:23,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 15:13:23,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925103760] [2019-12-27 15:13:23,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:23,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:23,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 40 transitions. [2019-12-27 15:13:23,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:23,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 15:13:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 15:13:23,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:13:23,573 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 28 states. [2019-12-27 15:13:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:24,153 INFO L93 Difference]: Finished difference Result 77 states and 156 transitions. [2019-12-27 15:13:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 15:13:24,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-12-27 15:13:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:24,154 INFO L225 Difference]: With dead ends: 77 [2019-12-27 15:13:24,155 INFO L226 Difference]: Without dead ends: 74 [2019-12-27 15:13:24,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=924, Invalid=1938, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 15:13:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-27 15:13:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-27 15:13:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-27 15:13:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 150 transitions. [2019-12-27 15:13:24,158 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 150 transitions. Word has length 32 [2019-12-27 15:13:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:24,158 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 150 transitions. [2019-12-27 15:13:24,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 15:13:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 150 transitions. [2019-12-27 15:13:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:13:24,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:24,159 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:24,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:24,363 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 187347254, now seen corresponding path program 49 times [2019-12-27 15:13:24,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:24,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139482620] [2019-12-27 15:13:24,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:24,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139482620] [2019-12-27 15:13:24,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848905215] [2019-12-27 15:13:24,658 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:24,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 15:13:24,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:24,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:24,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 15:13:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58335568] [2019-12-27 15:13:24,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:24,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:24,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 45 transitions. [2019-12-27 15:13:24,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:24,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 15:13:24,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:24,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 15:13:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:13:24,776 INFO L87 Difference]: Start difference. First operand 74 states and 150 transitions. Second operand 29 states. [2019-12-27 15:13:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:25,412 INFO L93 Difference]: Finished difference Result 78 states and 158 transitions. [2019-12-27 15:13:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 15:13:25,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-12-27 15:13:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:25,414 INFO L225 Difference]: With dead ends: 78 [2019-12-27 15:13:25,414 INFO L226 Difference]: Without dead ends: 75 [2019-12-27 15:13:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=2029, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 15:13:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-27 15:13:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2019-12-27 15:13:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-27 15:13:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2019-12-27 15:13:25,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 33 [2019-12-27 15:13:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:25,417 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2019-12-27 15:13:25,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 15:13:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2019-12-27 15:13:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:13:25,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:25,418 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:25,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:25,621 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 543136746, now seen corresponding path program 50 times [2019-12-27 15:13:25,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:25,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228301552] [2019-12-27 15:13:25,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228301552] [2019-12-27 15:13:26,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786556649] [2019-12-27 15:13:26,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:26,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:26,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:26,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 15:13:26,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:26,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:26,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 15:13:26,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2127107732] [2019-12-27 15:13:26,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:26,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:26,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 41 transitions. [2019-12-27 15:13:26,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:26,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:26,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 15:13:26,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:26,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 15:13:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 15:13:26,259 INFO L87 Difference]: Start difference. First operand 45 states and 92 transitions. Second operand 29 states. [2019-12-27 15:13:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:27,315 INFO L93 Difference]: Finished difference Result 79 states and 160 transitions. [2019-12-27 15:13:27,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:13:27,315 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-12-27 15:13:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:27,316 INFO L225 Difference]: With dead ends: 79 [2019-12-27 15:13:27,317 INFO L226 Difference]: Without dead ends: 76 [2019-12-27 15:13:27,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=993, Invalid=2087, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 15:13:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-27 15:13:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-27 15:13:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-27 15:13:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-27 15:13:27,323 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 33 [2019-12-27 15:13:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:27,323 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-27 15:13:27,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 15:13:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-27 15:13:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:13:27,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:27,324 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:27,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:27,529 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1512797635, now seen corresponding path program 51 times [2019-12-27 15:13:27,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:27,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490371116] [2019-12-27 15:13:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:27,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490371116] [2019-12-27 15:13:27,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678830631] [2019-12-27 15:13:27,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:27,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-27 15:13:27,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:27,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 15:13:27,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:27,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:27,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 15:13:27,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619096214] [2019-12-27 15:13:27,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:27,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:28,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 46 transitions. [2019-12-27 15:13:28,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:28,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:28,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 15:13:28,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 15:13:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:13:28,003 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 30 states. [2019-12-27 15:13:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:28,682 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2019-12-27 15:13:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 15:13:28,683 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-12-27 15:13:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:28,684 INFO L225 Difference]: With dead ends: 80 [2019-12-27 15:13:28,684 INFO L226 Difference]: Without dead ends: 77 [2019-12-27 15:13:28,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1011, Invalid=2181, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 15:13:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-27 15:13:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2019-12-27 15:13:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 15:13:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 15:13:28,688 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 34 [2019-12-27 15:13:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:28,688 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 15:13:28,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 15:13:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 15:13:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:13:28,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:28,689 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:28,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:28,892 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -342629753, now seen corresponding path program 52 times [2019-12-27 15:13:28,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:28,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90532399] [2019-12-27 15:13:28,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:29,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90532399] [2019-12-27 15:13:29,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37289832] [2019-12-27 15:13:29,205 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:29,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:29,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:29,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 15:13:29,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:29,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:29,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 15:13:29,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788651421] [2019-12-27 15:13:29,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:29,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:29,314 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 42 transitions. [2019-12-27 15:13:29,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:29,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:29,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 15:13:29,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 15:13:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:13:29,315 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 30 states. [2019-12-27 15:13:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:29,988 INFO L93 Difference]: Finished difference Result 81 states and 164 transitions. [2019-12-27 15:13:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 15:13:29,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-12-27 15:13:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:29,990 INFO L225 Difference]: With dead ends: 81 [2019-12-27 15:13:29,990 INFO L226 Difference]: Without dead ends: 78 [2019-12-27 15:13:29,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 15:13:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-27 15:13:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-27 15:13:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-27 15:13:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2019-12-27 15:13:29,994 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 34 [2019-12-27 15:13:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:29,994 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 158 transitions. [2019-12-27 15:13:29,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 15:13:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 158 transitions. [2019-12-27 15:13:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:13:29,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:29,995 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:30,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:30,198 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash -347913266, now seen corresponding path program 53 times [2019-12-27 15:13:30,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:30,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130936005] [2019-12-27 15:13:30,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:30,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130936005] [2019-12-27 15:13:30,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848167141] [2019-12-27 15:13:30,502 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:30,567 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-12-27 15:13:30,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:30,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 15:13:30,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:30,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:30,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 15:13:30,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963714472] [2019-12-27 15:13:30,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:30,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:30,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 47 transitions. [2019-12-27 15:13:30,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:30,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:30,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 15:13:30,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 15:13:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-27 15:13:30,638 INFO L87 Difference]: Start difference. First operand 78 states and 158 transitions. Second operand 31 states. [2019-12-27 15:13:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:31,345 INFO L93 Difference]: Finished difference Result 82 states and 166 transitions. [2019-12-27 15:13:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 15:13:31,345 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-12-27 15:13:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:31,346 INFO L225 Difference]: With dead ends: 82 [2019-12-27 15:13:31,346 INFO L226 Difference]: Without dead ends: 79 [2019-12-27 15:13:31,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1083, Invalid=2339, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 15:13:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-27 15:13:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2019-12-27 15:13:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-27 15:13:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 96 transitions. [2019-12-27 15:13:31,349 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 96 transitions. Word has length 35 [2019-12-27 15:13:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:31,350 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 96 transitions. [2019-12-27 15:13:31,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 15:13:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. [2019-12-27 15:13:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:13:31,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:31,350 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:31,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:31,551 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2031587694, now seen corresponding path program 54 times [2019-12-27 15:13:31,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:31,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810524640] [2019-12-27 15:13:31,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:31,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810524640] [2019-12-27 15:13:31,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977373273] [2019-12-27 15:13:31,878 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:31,951 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-12-27 15:13:31,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:31,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 15:13:31,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:31,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:31,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 15:13:31,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818621735] [2019-12-27 15:13:31,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:31,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:31,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 43 transitions. [2019-12-27 15:13:31,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:31,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:31,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 15:13:31,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:31,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 15:13:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-27 15:13:31,990 INFO L87 Difference]: Start difference. First operand 47 states and 96 transitions. Second operand 31 states. [2019-12-27 15:13:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:32,715 INFO L93 Difference]: Finished difference Result 83 states and 168 transitions. [2019-12-27 15:13:32,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 15:13:32,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-12-27 15:13:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:32,717 INFO L225 Difference]: With dead ends: 83 [2019-12-27 15:13:32,717 INFO L226 Difference]: Without dead ends: 80 [2019-12-27 15:13:32,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1139, Invalid=2401, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 15:13:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-27 15:13:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-27 15:13:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-27 15:13:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 162 transitions. [2019-12-27 15:13:32,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 162 transitions. Word has length 35 [2019-12-27 15:13:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:32,720 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 162 transitions. [2019-12-27 15:13:32,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 15:13:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 162 transitions. [2019-12-27 15:13:32,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 15:13:32,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:32,721 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:32,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:32,921 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2099590699, now seen corresponding path program 55 times [2019-12-27 15:13:32,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:32,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501408848] [2019-12-27 15:13:32,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:33,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501408848] [2019-12-27 15:13:33,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862949827] [2019-12-27 15:13:33,255 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:33,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 15:13:33,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:33,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:33,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 15:13:33,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924620920] [2019-12-27 15:13:33,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:33,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:33,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 48 transitions. [2019-12-27 15:13:33,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:33,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 15:13:33,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 15:13:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:13:33,360 INFO L87 Difference]: Start difference. First operand 80 states and 162 transitions. Second operand 32 states. [2019-12-27 15:13:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:34,251 INFO L93 Difference]: Finished difference Result 84 states and 170 transitions. [2019-12-27 15:13:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 15:13:34,252 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-12-27 15:13:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:34,252 INFO L225 Difference]: With dead ends: 84 [2019-12-27 15:13:34,253 INFO L226 Difference]: Without dead ends: 81 [2019-12-27 15:13:34,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 15:13:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-27 15:13:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2019-12-27 15:13:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 15:13:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 15:13:34,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 36 [2019-12-27 15:13:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:34,256 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 15:13:34,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 15:13:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 15:13:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 15:13:34,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:34,257 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:34,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:34,457 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1445291231, now seen corresponding path program 56 times [2019-12-27 15:13:34,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:34,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124590598] [2019-12-27 15:13:34,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124590598] [2019-12-27 15:13:34,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385054021] [2019-12-27 15:13:34,799 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:34,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:34,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:34,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 15:13:34,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:34,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:34,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 15:13:34,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203459075] [2019-12-27 15:13:34,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:34,900 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:34,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 44 transitions. [2019-12-27 15:13:34,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:34,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:34,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 15:13:34,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 15:13:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:13:34,911 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 32 states. [2019-12-27 15:13:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:35,664 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2019-12-27 15:13:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:13:35,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-12-27 15:13:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:35,666 INFO L225 Difference]: With dead ends: 85 [2019-12-27 15:13:35,666 INFO L226 Difference]: Without dead ends: 82 [2019-12-27 15:13:35,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1216, Invalid=2566, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 15:13:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-27 15:13:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-27 15:13:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-27 15:13:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 166 transitions. [2019-12-27 15:13:35,670 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 166 transitions. Word has length 36 [2019-12-27 15:13:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:35,670 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 166 transitions. [2019-12-27 15:13:35,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 15:13:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 166 transitions. [2019-12-27 15:13:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 15:13:35,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:35,671 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:35,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:35,874 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash 662802534, now seen corresponding path program 57 times [2019-12-27 15:13:35,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:35,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41384469] [2019-12-27 15:13:35,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:36,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41384469] [2019-12-27 15:13:36,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055423253] [2019-12-27 15:13:36,232 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:36,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-27 15:13:36,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:36,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 15:13:36,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:36,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 15:13:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889572020] [2019-12-27 15:13:36,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:36,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:36,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 49 transitions. [2019-12-27 15:13:36,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:36,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:36,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 15:13:36,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 15:13:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 15:13:36,368 INFO L87 Difference]: Start difference. First operand 82 states and 166 transitions. Second operand 33 states. [2019-12-27 15:13:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:37,141 INFO L93 Difference]: Finished difference Result 86 states and 174 transitions. [2019-12-27 15:13:37,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 15:13:37,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-12-27 15:13:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:37,143 INFO L225 Difference]: With dead ends: 86 [2019-12-27 15:13:37,143 INFO L226 Difference]: Without dead ends: 83 [2019-12-27 15:13:37,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1235, Invalid=2671, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 15:13:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-27 15:13:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2019-12-27 15:13:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-27 15:13:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2019-12-27 15:13:37,147 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 100 transitions. Word has length 37 [2019-12-27 15:13:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:37,147 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 100 transitions. [2019-12-27 15:13:37,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 15:13:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 100 transitions. [2019-12-27 15:13:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 15:13:37,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:37,148 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:37,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:37,351 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1854355258, now seen corresponding path program 58 times [2019-12-27 15:13:37,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:37,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870717172] [2019-12-27 15:13:37,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:37,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870717172] [2019-12-27 15:13:37,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675871644] [2019-12-27 15:13:37,705 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:37,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:37,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:37,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 15:13:37,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:37,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:37,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 15:13:37,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75220488] [2019-12-27 15:13:37,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:37,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:37,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 45 transitions. [2019-12-27 15:13:37,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:37,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:37,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 15:13:37,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 15:13:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 15:13:37,819 INFO L87 Difference]: Start difference. First operand 49 states and 100 transitions. Second operand 33 states. [2019-12-27 15:13:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:39,092 INFO L93 Difference]: Finished difference Result 87 states and 176 transitions. [2019-12-27 15:13:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 15:13:39,093 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-12-27 15:13:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:39,094 INFO L225 Difference]: With dead ends: 87 [2019-12-27 15:13:39,094 INFO L226 Difference]: Without dead ends: 84 [2019-12-27 15:13:39,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1295, Invalid=2737, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 15:13:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-27 15:13:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-27 15:13:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-27 15:13:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 170 transitions. [2019-12-27 15:13:39,097 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 170 transitions. Word has length 37 [2019-12-27 15:13:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:39,097 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 170 transitions. [2019-12-27 15:13:39,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 15:13:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 170 transitions. [2019-12-27 15:13:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 15:13:39,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:39,098 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:39,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:39,301 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash -927957869, now seen corresponding path program 59 times [2019-12-27 15:13:39,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:39,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191378542] [2019-12-27 15:13:39,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:39,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191378542] [2019-12-27 15:13:39,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118117791] [2019-12-27 15:13:39,923 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:40,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-27 15:13:40,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:40,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 15:13:40,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:40,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:40,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 15:13:40,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547395489] [2019-12-27 15:13:40,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:40,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:40,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 50 transitions. [2019-12-27 15:13:40,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:40,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:40,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 15:13:40,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:40,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 15:13:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:13:40,133 INFO L87 Difference]: Start difference. First operand 84 states and 170 transitions. Second operand 34 states. [2019-12-27 15:13:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:41,128 INFO L93 Difference]: Finished difference Result 88 states and 178 transitions. [2019-12-27 15:13:41,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 15:13:41,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-12-27 15:13:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:41,130 INFO L225 Difference]: With dead ends: 88 [2019-12-27 15:13:41,130 INFO L226 Difference]: Without dead ends: 85 [2019-12-27 15:13:41,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1315, Invalid=2845, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 15:13:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-27 15:13:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-12-27 15:13:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 15:13:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 15:13:41,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 38 [2019-12-27 15:13:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:41,133 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 15:13:41,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 15:13:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 15:13:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 15:13:41,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:41,134 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:41,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:41,338 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1650438455, now seen corresponding path program 60 times [2019-12-27 15:13:41,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:41,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731375395] [2019-12-27 15:13:41,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:41,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731375395] [2019-12-27 15:13:41,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734211919] [2019-12-27 15:13:41,851 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:41,969 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-12-27 15:13:41,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:41,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 15:13:41,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:42,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:42,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 15:13:42,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11794993] [2019-12-27 15:13:42,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:42,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:42,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 46 transitions. [2019-12-27 15:13:42,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:42,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:42,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 15:13:42,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 15:13:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:13:42,052 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 34 states. [2019-12-27 15:13:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:42,990 INFO L93 Difference]: Finished difference Result 89 states and 180 transitions. [2019-12-27 15:13:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 15:13:42,990 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-12-27 15:13:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:42,991 INFO L225 Difference]: With dead ends: 89 [2019-12-27 15:13:42,991 INFO L226 Difference]: Without dead ends: 86 [2019-12-27 15:13:42,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1377, Invalid=2913, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 15:13:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-27 15:13:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-27 15:13:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-27 15:13:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 174 transitions. [2019-12-27 15:13:42,994 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 174 transitions. Word has length 38 [2019-12-27 15:13:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:42,995 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 174 transitions. [2019-12-27 15:13:42,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 15:13:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 174 transitions. [2019-12-27 15:13:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:13:42,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:42,996 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:43,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:43,200 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1298077438, now seen corresponding path program 61 times [2019-12-27 15:13:43,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:43,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163900536] [2019-12-27 15:13:43,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163900536] [2019-12-27 15:13:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850358001] [2019-12-27 15:13:43,761 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:43,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 15:13:43,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:43,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:43,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 15:13:43,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280431290] [2019-12-27 15:13:43,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:43,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:43,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 51 transitions. [2019-12-27 15:13:43,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:43,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:43,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 15:13:43,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 15:13:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:13:43,889 INFO L87 Difference]: Start difference. First operand 86 states and 174 transitions. Second operand 35 states. [2019-12-27 15:13:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:44,755 INFO L93 Difference]: Finished difference Result 90 states and 182 transitions. [2019-12-27 15:13:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 15:13:44,755 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-12-27 15:13:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:44,756 INFO L225 Difference]: With dead ends: 90 [2019-12-27 15:13:44,756 INFO L226 Difference]: Without dead ends: 87 [2019-12-27 15:13:44,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1397, Invalid=3025, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 15:13:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-27 15:13:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2019-12-27 15:13:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-27 15:13:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2019-12-27 15:13:44,760 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 39 [2019-12-27 15:13:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:44,760 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2019-12-27 15:13:44,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 15:13:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2019-12-27 15:13:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:13:44,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:44,761 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:44,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:44,962 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -376015390, now seen corresponding path program 62 times [2019-12-27 15:13:44,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:44,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292610247] [2019-12-27 15:13:44,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:45,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292610247] [2019-12-27 15:13:45,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373797347] [2019-12-27 15:13:45,383 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:45,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:45,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:45,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 15:13:45,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:45,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:45,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 15:13:45,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400649456] [2019-12-27 15:13:45,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:45,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:45,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 47 transitions. [2019-12-27 15:13:45,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:45,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:45,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 15:13:45,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 15:13:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:13:45,491 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand 35 states. [2019-12-27 15:13:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:46,553 INFO L93 Difference]: Finished difference Result 91 states and 184 transitions. [2019-12-27 15:13:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 15:13:46,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-12-27 15:13:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:46,554 INFO L225 Difference]: With dead ends: 91 [2019-12-27 15:13:46,554 INFO L226 Difference]: Without dead ends: 88 [2019-12-27 15:13:46,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1461, Invalid=3095, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 15:13:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-27 15:13:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-27 15:13:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-27 15:13:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 178 transitions. [2019-12-27 15:13:46,559 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 178 transitions. Word has length 39 [2019-12-27 15:13:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:46,560 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 178 transitions. [2019-12-27 15:13:46,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 15:13:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 178 transitions. [2019-12-27 15:13:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:13:46,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:46,561 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:46,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:46,761 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1585694971, now seen corresponding path program 63 times [2019-12-27 15:13:46,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:46,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13465909] [2019-12-27 15:13:46,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:47,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13465909] [2019-12-27 15:13:47,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830393405] [2019-12-27 15:13:47,170 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:47,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-12-27 15:13:47,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:47,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 15:13:47,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:47,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:47,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 15:13:47,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624151598] [2019-12-27 15:13:47,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:47,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:47,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 52 transitions. [2019-12-27 15:13:47,337 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:47,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:47,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 15:13:47,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 15:13:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 15:13:47,339 INFO L87 Difference]: Start difference. First operand 88 states and 178 transitions. Second operand 36 states. [2019-12-27 15:13:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:48,242 INFO L93 Difference]: Finished difference Result 92 states and 186 transitions. [2019-12-27 15:13:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 15:13:48,242 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-12-27 15:13:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:48,243 INFO L225 Difference]: With dead ends: 92 [2019-12-27 15:13:48,244 INFO L226 Difference]: Without dead ends: 89 [2019-12-27 15:13:48,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1482, Invalid=3210, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 15:13:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-27 15:13:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-12-27 15:13:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 15:13:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 15:13:48,246 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 40 [2019-12-27 15:13:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:48,247 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 15:13:48,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 15:13:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 15:13:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:13:48,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:48,247 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:48,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:48,448 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1228425103, now seen corresponding path program 64 times [2019-12-27 15:13:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:48,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449258132] [2019-12-27 15:13:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:48,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449258132] [2019-12-27 15:13:48,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049106234] [2019-12-27 15:13:48,865 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:48,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:48,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:48,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 15:13:48,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:48,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:48,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 15:13:48,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040306662] [2019-12-27 15:13:48,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:48,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:48,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 48 transitions. [2019-12-27 15:13:48,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:48,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:48,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 15:13:48,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:48,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 15:13:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 15:13:48,974 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 36 states. [2019-12-27 15:13:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:49,891 INFO L93 Difference]: Finished difference Result 93 states and 188 transitions. [2019-12-27 15:13:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 15:13:49,891 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-12-27 15:13:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:49,892 INFO L225 Difference]: With dead ends: 93 [2019-12-27 15:13:49,892 INFO L226 Difference]: Without dead ends: 90 [2019-12-27 15:13:49,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1548, Invalid=3282, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 15:13:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-27 15:13:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-27 15:13:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-27 15:13:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-12-27 15:13:49,896 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 40 [2019-12-27 15:13:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-12-27 15:13:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 15:13:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-12-27 15:13:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:13:49,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:49,897 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:50,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:50,098 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1911904150, now seen corresponding path program 65 times [2019-12-27 15:13:50,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:50,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175738540] [2019-12-27 15:13:50,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:50,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175738540] [2019-12-27 15:13:50,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370939080] [2019-12-27 15:13:50,527 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:50,600 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-27 15:13:50,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:50,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 15:13:50,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:50,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:50,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 15:13:50,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157543230] [2019-12-27 15:13:50,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:50,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:50,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 53 transitions. [2019-12-27 15:13:50,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:50,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:50,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 15:13:50,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:50,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 15:13:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 15:13:50,649 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 37 states. [2019-12-27 15:13:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:51,626 INFO L93 Difference]: Finished difference Result 94 states and 190 transitions. [2019-12-27 15:13:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 15:13:51,626 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 41 [2019-12-27 15:13:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:51,627 INFO L225 Difference]: With dead ends: 94 [2019-12-27 15:13:51,627 INFO L226 Difference]: Without dead ends: 91 [2019-12-27 15:13:51,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1569, Invalid=3401, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 15:13:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-27 15:13:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2019-12-27 15:13:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-27 15:13:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 108 transitions. [2019-12-27 15:13:51,630 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 108 transitions. Word has length 41 [2019-12-27 15:13:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:51,630 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 108 transitions. [2019-12-27 15:13:51,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 15:13:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 108 transitions. [2019-12-27 15:13:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:13:51,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:51,631 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:51,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:51,835 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -573527414, now seen corresponding path program 66 times [2019-12-27 15:13:51,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:51,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820858337] [2019-12-27 15:13:51,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:52,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820858337] [2019-12-27 15:13:52,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511628024] [2019-12-27 15:13:52,241 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:52,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-27 15:13:52,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:52,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 15:13:52,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:52,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:52,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 15:13:52,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703316353] [2019-12-27 15:13:52,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:52,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:52,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 49 transitions. [2019-12-27 15:13:52,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:52,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:52,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 15:13:52,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:52,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 15:13:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 15:13:52,368 INFO L87 Difference]: Start difference. First operand 53 states and 108 transitions. Second operand 37 states. [2019-12-27 15:13:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:53,338 INFO L93 Difference]: Finished difference Result 95 states and 192 transitions. [2019-12-27 15:13:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 15:13:53,339 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 41 [2019-12-27 15:13:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:53,340 INFO L225 Difference]: With dead ends: 95 [2019-12-27 15:13:53,340 INFO L226 Difference]: Without dead ends: 92 [2019-12-27 15:13:53,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1637, Invalid=3475, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 15:13:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-27 15:13:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-27 15:13:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-27 15:13:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 186 transitions. [2019-12-27 15:13:53,344 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 186 transitions. Word has length 41 [2019-12-27 15:13:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:53,344 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 186 transitions. [2019-12-27 15:13:53,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 15:13:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 186 transitions. [2019-12-27 15:13:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 15:13:53,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:53,345 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:53,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:53,549 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -860513437, now seen corresponding path program 67 times [2019-12-27 15:13:53,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:53,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257857622] [2019-12-27 15:13:53,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:53,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257857622] [2019-12-27 15:13:53,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172623288] [2019-12-27 15:13:53,982 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:54,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-27 15:13:54,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:54,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 15:13:54,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104728533] [2019-12-27 15:13:54,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:54,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:54,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 54 transitions. [2019-12-27 15:13:54,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:54,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:54,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 15:13:54,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 15:13:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:13:54,098 INFO L87 Difference]: Start difference. First operand 92 states and 186 transitions. Second operand 38 states. [2019-12-27 15:13:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:55,125 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2019-12-27 15:13:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 15:13:55,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 42 [2019-12-27 15:13:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:55,127 INFO L225 Difference]: With dead ends: 96 [2019-12-27 15:13:55,127 INFO L226 Difference]: Without dead ends: 93 [2019-12-27 15:13:55,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1659, Invalid=3597, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 15:13:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-27 15:13:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-12-27 15:13:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 15:13:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 15:13:55,130 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 42 [2019-12-27 15:13:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:55,131 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 15:13:55,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 15:13:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 15:13:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 15:13:55,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:55,132 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:55,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:55,335 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash -599480345, now seen corresponding path program 68 times [2019-12-27 15:13:55,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:55,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707854099] [2019-12-27 15:13:55,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:55,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707854099] [2019-12-27 15:13:55,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578702797] [2019-12-27 15:13:55,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:55,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:55,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:55,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-27 15:13:55,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 15:13:55,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803119287] [2019-12-27 15:13:55,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:55,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:55,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 50 transitions. [2019-12-27 15:13:55,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:55,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:55,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 15:13:55,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 15:13:55,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 15:13:55,902 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 38 states. [2019-12-27 15:13:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:56,912 INFO L93 Difference]: Finished difference Result 97 states and 196 transitions. [2019-12-27 15:13:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 15:13:56,912 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 42 [2019-12-27 15:13:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:56,913 INFO L225 Difference]: With dead ends: 97 [2019-12-27 15:13:56,913 INFO L226 Difference]: Without dead ends: 94 [2019-12-27 15:13:56,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1729, Invalid=3673, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 15:13:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-27 15:13:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-27 15:13:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-27 15:13:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 190 transitions. [2019-12-27 15:13:56,917 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 190 transitions. Word has length 42 [2019-12-27 15:13:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:56,918 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 190 transitions. [2019-12-27 15:13:56,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 15:13:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 190 transitions. [2019-12-27 15:13:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:13:56,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:56,919 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:57,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:57,122 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -906112466, now seen corresponding path program 69 times [2019-12-27 15:13:57,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:57,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938559212] [2019-12-27 15:13:57,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:57,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938559212] [2019-12-27 15:13:57,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191444674] [2019-12-27 15:13:57,573 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:57,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-27 15:13:57,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:57,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 15:13:57,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:57,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:57,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 15:13:57,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523905134] [2019-12-27 15:13:57,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:57,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:57,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 55 transitions. [2019-12-27 15:13:57,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:57,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:57,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 15:13:57,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 15:13:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 15:13:57,709 INFO L87 Difference]: Start difference. First operand 94 states and 190 transitions. Second operand 39 states. [2019-12-27 15:13:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:58,767 INFO L93 Difference]: Finished difference Result 98 states and 198 transitions. [2019-12-27 15:13:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 15:13:58,767 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-12-27 15:13:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:58,768 INFO L225 Difference]: With dead ends: 98 [2019-12-27 15:13:58,769 INFO L226 Difference]: Without dead ends: 95 [2019-12-27 15:13:58,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1751, Invalid=3799, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 15:13:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-27 15:13:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2019-12-27 15:13:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-27 15:13:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 112 transitions. [2019-12-27 15:13:58,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 112 transitions. Word has length 43 [2019-12-27 15:13:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:58,772 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 112 transitions. [2019-12-27 15:13:58,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 15:13:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 112 transitions. [2019-12-27 15:13:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:13:58,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:58,773 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:58,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:58,974 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:58,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1404021454, now seen corresponding path program 70 times [2019-12-27 15:13:58,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:58,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120903739] [2019-12-27 15:13:58,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:59,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120903739] [2019-12-27 15:13:59,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904262445] [2019-12-27 15:13:59,455 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:59,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:59,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:59,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 15:13:59,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:59,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:59,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 15:13:59,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301170148] [2019-12-27 15:13:59,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:59,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:59,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 51 transitions. [2019-12-27 15:13:59,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:59,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:59,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 15:13:59,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 15:13:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 15:13:59,578 INFO L87 Difference]: Start difference. First operand 55 states and 112 transitions. Second operand 39 states. [2019-12-27 15:14:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:00,615 INFO L93 Difference]: Finished difference Result 99 states and 200 transitions. [2019-12-27 15:14:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 15:14:00,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-12-27 15:14:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:00,616 INFO L225 Difference]: With dead ends: 99 [2019-12-27 15:14:00,616 INFO L226 Difference]: Without dead ends: 96 [2019-12-27 15:14:00,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1823, Invalid=3877, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 15:14:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-27 15:14:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-27 15:14:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-27 15:14:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 194 transitions. [2019-12-27 15:14:00,619 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 194 transitions. Word has length 43 [2019-12-27 15:14:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:00,619 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 194 transitions. [2019-12-27 15:14:00,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 15:14:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 194 transitions. [2019-12-27 15:14:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 15:14:00,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:00,620 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:00,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:00,821 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1975284683, now seen corresponding path program 71 times [2019-12-27 15:14:00,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:00,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806475122] [2019-12-27 15:14:00,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:01,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806475122] [2019-12-27 15:14:01,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415726412] [2019-12-27 15:14:01,318 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:01,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-27 15:14:01,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:14:01,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 15:14:01,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:01,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:01,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 15:14:01,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [423109413] [2019-12-27 15:14:01,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:01,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:01,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 56 transitions. [2019-12-27 15:14:01,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:01,454 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:14:01,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 15:14:01,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:01,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 15:14:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:14:01,455 INFO L87 Difference]: Start difference. First operand 96 states and 194 transitions. Second operand 40 states. [2019-12-27 15:14:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:02,552 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2019-12-27 15:14:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 15:14:02,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-12-27 15:14:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:02,553 INFO L225 Difference]: With dead ends: 100 [2019-12-27 15:14:02,553 INFO L226 Difference]: Without dead ends: 97 [2019-12-27 15:14:02,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1846, Invalid=4006, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 15:14:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-27 15:14:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2019-12-27 15:14:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 15:14:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 15:14:02,556 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 44 [2019-12-27 15:14:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:02,556 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 15:14:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 15:14:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 15:14:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 15:14:02,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:02,557 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:02,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:02,761 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:02,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:02,761 INFO L82 PathProgramCache]: Analyzing trace with hash -574991809, now seen corresponding path program 72 times [2019-12-27 15:14:02,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:02,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115367374] [2019-12-27 15:14:02,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:03,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115367374] [2019-12-27 15:14:03,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510593348] [2019-12-27 15:14:03,240 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:03,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-27 15:14:03,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:14:03,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 15:14:03,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:03,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:03,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 15:14:03,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335250490] [2019-12-27 15:14:03,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:03,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:03,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 52 transitions. [2019-12-27 15:14:03,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:03,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:14:03,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 15:14:03,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 15:14:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:14:03,420 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 40 states. [2019-12-27 15:14:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:04,839 INFO L93 Difference]: Finished difference Result 101 states and 204 transitions. [2019-12-27 15:14:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:14:04,840 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-12-27 15:14:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:04,841 INFO L225 Difference]: With dead ends: 101 [2019-12-27 15:14:04,841 INFO L226 Difference]: Without dead ends: 98 [2019-12-27 15:14:04,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1920, Invalid=4086, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 15:14:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-27 15:14:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-27 15:14:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-27 15:14:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2019-12-27 15:14:04,844 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 198 transitions. Word has length 44 [2019-12-27 15:14:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:04,845 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 198 transitions. [2019-12-27 15:14:04,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 15:14:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 198 transitions. [2019-12-27 15:14:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 15:14:04,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:04,845 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:05,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:05,046 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1104283334, now seen corresponding path program 73 times [2019-12-27 15:14:05,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:05,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885693561] [2019-12-27 15:14:05,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:05,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885693561] [2019-12-27 15:14:05,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466195378] [2019-12-27 15:14:05,690 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:05,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 15:14:05,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 15:14:05,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335795004] [2019-12-27 15:14:05,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:05,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:05,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 57 transitions. [2019-12-27 15:14:05,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:05,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:14:05,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 15:14:05,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 15:14:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:14:05,824 INFO L87 Difference]: Start difference. First operand 98 states and 198 transitions. Second operand 41 states. [2019-12-27 15:14:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:06,969 INFO L93 Difference]: Finished difference Result 102 states and 206 transitions. [2019-12-27 15:14:06,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:14:06,969 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-12-27 15:14:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:06,970 INFO L225 Difference]: With dead ends: 102 [2019-12-27 15:14:06,970 INFO L226 Difference]: Without dead ends: 99 [2019-12-27 15:14:06,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1943, Invalid=4219, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 15:14:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-27 15:14:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-12-27 15:14:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-27 15:14:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 116 transitions. [2019-12-27 15:14:06,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 116 transitions. Word has length 45 [2019-12-27 15:14:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:06,974 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 116 transitions. [2019-12-27 15:14:06,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 15:14:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 116 transitions. [2019-12-27 15:14:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 15:14:06,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:06,974 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:07,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:07,176 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash -644876838, now seen corresponding path program 74 times [2019-12-27 15:14:07,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:07,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474477210] [2019-12-27 15:14:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:07,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474477210] [2019-12-27 15:14:07,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000503036] [2019-12-27 15:14:07,711 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:07,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:14:07,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:14:07,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 15:14:07,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:07,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:07,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 15:14:07,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277314357] [2019-12-27 15:14:07,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:07,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:07,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 53 transitions. [2019-12-27 15:14:07,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:07,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:14:07,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 15:14:07,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 15:14:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:14:07,859 INFO L87 Difference]: Start difference. First operand 57 states and 116 transitions. Second operand 41 states. [2019-12-27 15:14:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:08,987 INFO L93 Difference]: Finished difference Result 103 states and 208 transitions. [2019-12-27 15:14:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 15:14:08,987 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-12-27 15:14:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:08,988 INFO L225 Difference]: With dead ends: 103 [2019-12-27 15:14:08,989 INFO L226 Difference]: Without dead ends: 100 [2019-12-27 15:14:08,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2019, Invalid=4301, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 15:14:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-27 15:14:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-27 15:14:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-27 15:14:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 202 transitions. [2019-12-27 15:14:08,996 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 202 transitions. Word has length 45 [2019-12-27 15:14:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 202 transitions. [2019-12-27 15:14:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 15:14:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 202 transitions. [2019-12-27 15:14:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 15:14:08,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:08,997 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:09,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:09,200 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -126954957, now seen corresponding path program 75 times [2019-12-27 15:14:09,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:09,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305164619] [2019-12-27 15:14:09,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:09,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305164619] [2019-12-27 15:14:09,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901356641] [2019-12-27 15:14:09,730 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:09,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-27 15:14:09,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:14:09,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-27 15:14:09,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:09,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:09,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 15:14:09,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [439289310] [2019-12-27 15:14:09,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:09,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:09,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 58 transitions. [2019-12-27 15:14:09,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:09,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:14:09,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 15:14:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 15:14:09,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 15:14:09,871 INFO L87 Difference]: Start difference. First operand 100 states and 202 transitions. Second operand 42 states. [2019-12-27 15:14:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:11,077 INFO L93 Difference]: Finished difference Result 104 states and 210 transitions. [2019-12-27 15:14:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 15:14:11,077 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 46 [2019-12-27 15:14:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:11,078 INFO L225 Difference]: With dead ends: 104 [2019-12-27 15:14:11,078 INFO L226 Difference]: Without dead ends: 101 [2019-12-27 15:14:11,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2043, Invalid=4437, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 15:14:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-27 15:14:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-12-27 15:14:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 15:14:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 15:14:11,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 46 [2019-12-27 15:14:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:11,082 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 15:14:11,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 15:14:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 15:14:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 15:14:11,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:11,083 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:11,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:11,286 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1483654807, now seen corresponding path program 76 times [2019-12-27 15:14:11,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:11,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686081329] [2019-12-27 15:14:11,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:11,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686081329] [2019-12-27 15:14:11,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713984912] [2019-12-27 15:14:11,838 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:11,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:14:11,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:14:11,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 15:14:11,908 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:14:11,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:11,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 15:14:11,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403542547] [2019-12-27 15:14:11,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:11,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:11,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 54 transitions. [2019-12-27 15:14:11,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:11,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:14:11,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 15:14:11,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:11,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 15:14:11,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 15:14:11,963 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 42 states. [2019-12-27 15:14:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:13,147 INFO L93 Difference]: Finished difference Result 105 states and 212 transitions. [2019-12-27 15:14:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 15:14:13,148 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 46 [2019-12-27 15:14:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:13,149 INFO L225 Difference]: With dead ends: 105 [2019-12-27 15:14:13,149 INFO L226 Difference]: Without dead ends: 102 [2019-12-27 15:14:13,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2121, Invalid=4521, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 15:14:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-27 15:14:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-27 15:14:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-27 15:14:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 206 transitions. [2019-12-27 15:14:13,152 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 206 transitions. Word has length 46 [2019-12-27 15:14:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:13,152 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 206 transitions. [2019-12-27 15:14:13,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 15:14:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2019-12-27 15:14:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:14:13,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:13,153 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:13,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:13,357 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 359363934, now seen corresponding path program 77 times [2019-12-27 15:14:13,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:13,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983481739] [2019-12-27 15:14:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:14:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:14:13,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:14:13,433 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:14:13,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 15:14:13,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-27 15:14:13,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_4 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_12 0) (= v_t1Thread1of1ForFork1_~arg.base_4 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_4, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_4, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_12, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= v_t2Thread1of1ForFork0_~arg.offset_4 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_12) (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_4)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_4, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_4, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_12, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 15:14:13,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 15:14:13,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condJ~0_15 0)) (.cse0 (= v_ULTIMATE.start_main_~condI~0_15 0))) (and (or (not .cse0) (not .cse1)) (let ((.cse2 (<= 46 v_~j~0_27))) (or (and .cse2 (= v_ULTIMATE.start_main_~condJ~0_15 1)) (and (not .cse2) .cse1))) (let ((.cse3 (<= 46 v_~i~0_25))) (or (and .cse0 (not .cse3)) (and .cse3 (= v_ULTIMATE.start_main_~condI~0_15 1)))))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-27 15:14:13,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:14:13 BasicIcfg [2019-12-27 15:14:13,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:14:13,464 INFO L168 Benchmark]: Toolchain (without parser) took 88602.99 ms. Allocated memory was 137.9 MB in the beginning and 583.0 MB in the end (delta: 445.1 MB). Free memory was 100.1 MB in the beginning and 372.6 MB in the end (delta: -272.5 MB). Peak memory consumption was 172.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,466 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.98 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 161.2 MB in the end (delta: -61.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 202.9 MB. Free memory was 161.2 MB in the beginning and 159.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,467 INFO L168 Benchmark]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 202.9 MB. Free memory was 159.2 MB in the beginning and 157.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,467 INFO L168 Benchmark]: RCFGBuilder took 408.84 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 137.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,468 INFO L168 Benchmark]: TraceAbstraction took 87412.42 ms. Allocated memory was 202.9 MB in the beginning and 583.0 MB in the end (delta: 380.1 MB). Free memory was 137.2 MB in the beginning and 372.6 MB in the end (delta: -235.5 MB). Peak memory consumption was 144.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:14:13,470 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 689.98 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 161.2 MB in the end (delta: -61.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 202.9 MB. Free memory was 161.2 MB in the beginning and 159.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 202.9 MB. Free memory was 159.2 MB in the beginning and 157.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.84 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 137.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87412.42 ms. Allocated memory was 202.9 MB in the beginning and 583.0 MB in the end (delta: 380.1 MB). Free memory was 137.2 MB in the beginning and 372.6 MB in the end (delta: -235.5 MB). Peak memory consumption was 144.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 87.2s, OverallIterations: 79, TraceHistogramMax: 20, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 741 SDtfs, 2483 SDslu, 3021 SDs, 0 SdLazy, 4742 SolverSat, 5303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5270 GetRequests, 2040 SyntacticMatches, 0 SemanticMatches, 3230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32221 ImplicationChecksByTransitivity, 52.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=78, 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, 78 MinimizatonAttempts, 931 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 4221 NumberOfCodeBlocks, 4221 NumberOfCodeBlocksAsserted, 533 NumberOfCheckSat, 4022 ConstructedInterpolants, 0 QuantifiedInterpolants, 394964 SizeOfPredicates, 1480 NumberOfNonLiveVariables, 12506 ConjunctsInSsa, 1858 ConjunctsInUnsatCore, 152 InterpolantComputations, 4 PerfectInterpolantSequences, 0/19000 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 incorrect! Received shutdown request...