/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 20:51:03,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 20:51:03,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 20:51:03,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 20:51:03,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 20:51:03,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 20:51:03,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 20:51:03,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 20:51:03,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 20:51:03,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 20:51:03,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 20:51:03,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 20:51:03,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 20:51:03,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 20:51:03,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 20:51:03,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 20:51:03,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 20:51:03,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 20:51:03,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 20:51:03,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 20:51:03,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 20:51:03,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 20:51:03,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 20:51:03,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 20:51:03,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 20:51:03,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 20:51:03,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 20:51:03,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 20:51:03,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 20:51:03,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 20:51:03,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 20:51:03,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 20:51:03,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 20:51:03,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 20:51:03,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 20:51:03,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 20:51:03,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 20:51:03,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 20:51:03,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 20:51:03,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 20:51:03,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 20:51:03,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 20:51:03,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 20:51:03,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 20:51:03,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 20:51:03,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 20:51:03,703 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 20:51:03,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 20:51:03,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 20:51:03,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 20:51:03,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 20:51:03,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 20:51:03,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 20:51:03,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 20:51:03,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 20:51:03,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 20:51:03,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 20:51:03,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 20:51:03,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 20:51:03,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 20:51:03,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 20:51:03,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 20:51:03,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 20:51:03,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 20:51:03,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 20:51:03,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 20:51:03,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 20:51:03,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 20:51:03,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 20:51:03,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 20:51:03,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 20:51:03,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 20:51:03,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 20:51:04,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 20:51:04,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 20:51:04,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 20:51:04,015 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 20:51:04,016 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-26 20:51:04,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbaab363/2da8a456758c47a39acf6c34fbf66723/FLAG4ac0d853d [2019-12-26 20:51:04,600 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 20:51:04,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-26 20:51:04,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbaab363/2da8a456758c47a39acf6c34fbf66723/FLAG4ac0d853d [2019-12-26 20:51:04,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcbaab363/2da8a456758c47a39acf6c34fbf66723 [2019-12-26 20:51:04,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 20:51:04,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 20:51:04,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 20:51:04,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 20:51:04,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 20:51:04,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:51:04" (1/1) ... [2019-12-26 20:51:04,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ac8158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:04, skipping insertion in model container [2019-12-26 20:51:04,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:51:04" (1/1) ... [2019-12-26 20:51:04,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 20:51:04,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 20:51:05,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:51:05,500 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 20:51:05,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:51:05,625 INFO L208 MainTranslator]: Completed translation [2019-12-26 20:51:05,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05 WrapperNode [2019-12-26 20:51:05,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 20:51:05,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 20:51:05,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 20:51:05,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 20:51:05,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 20:51:05,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 20:51:05,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 20:51:05,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 20:51:05,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (1/1) ... [2019-12-26 20:51:05,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 20:51:05,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 20:51:05,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 20:51:05,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 20:51:05,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (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-26 20:51:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-26 20:51:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-26 20:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-26 20:51:05,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-26 20:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 20:51:05,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 20:51:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 20:51:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 20:51:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 20:51:05,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 20:51:05,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 20:51:05,767 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 20:51:06,100 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 20:51:06,101 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-26 20:51:06,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:51:06 BoogieIcfgContainer [2019-12-26 20:51:06,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 20:51:06,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 20:51:06,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 20:51:06,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 20:51:06,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 08:51:04" (1/3) ... [2019-12-26 20:51:06,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374f9a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:51:06, skipping insertion in model container [2019-12-26 20:51:06,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:51:05" (2/3) ... [2019-12-26 20:51:06,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374f9a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:51:06, skipping insertion in model container [2019-12-26 20:51:06,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:51:06" (3/3) ... [2019-12-26 20:51:06,111 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-26 20:51:06,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 20:51:06,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 20:51:06,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-26 20:51:06,129 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 20:51:06,162 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,165 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,165 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,166 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,166 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,167 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,170 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,171 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,171 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,171 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,171 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,172 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,172 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,172 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,173 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,173 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,173 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,174 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,174 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,174 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,175 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,175 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,175 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,176 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,176 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,176 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,176 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,177 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,181 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,181 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,182 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,182 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,182 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,182 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,188 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,189 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,189 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,189 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,189 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,190 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:51:06,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-26 20:51:06,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:51:06,230 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:51:06,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:51:06,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:51:06,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:51:06,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:51:06,230 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:51:06,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:51:06,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-26 20:51:06,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-26 20:51:06,289 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-26 20:51:06,289 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 20:51:06,295 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-26 20:51:06,299 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-26 20:51:06,317 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-26 20:51:06,318 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 20:51:06,319 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-26 20:51:06,321 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-26 20:51:06,323 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:51:07,490 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-26 20:51:07,632 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-26 20:51:07,632 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-26 20:51:07,636 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-26 20:51:07,646 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-26 20:51:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-26 20:51:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 20:51:07,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:07,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 20:51:07,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:07,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-26 20:51:07,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:07,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988755326] [2019-12-26 20:51:07,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:07,858 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-26 20:51:07,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988755326] [2019-12-26 20:51:07,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:51:07,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 20:51:07,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147436370] [2019-12-26 20:51:07,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:51:07,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:51:07,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:51:07,885 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-26 20:51:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:07,923 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-26 20:51:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:51:07,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 20:51:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:07,937 INFO L225 Difference]: With dead ends: 48 [2019-12-26 20:51:07,938 INFO L226 Difference]: Without dead ends: 28 [2019-12-26 20:51:07,939 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-26 20:51:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-26 20:51:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-26 20:51:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-26 20:51:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-26 20:51:07,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-26 20:51:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:07,981 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-26 20:51:07,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:51:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-26 20:51:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:51:07,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:07,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:07,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-26 20:51:07,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:07,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215203060] [2019-12-26 20:51:07,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:08,077 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-26 20:51:08,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215203060] [2019-12-26 20:51:08,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:51:08,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:51:08,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600181659] [2019-12-26 20:51:08,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:51:08,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:51:08,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:51:08,081 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-26 20:51:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:08,107 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-26 20:51:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:51:08,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-26 20:51:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:08,109 INFO L225 Difference]: With dead ends: 34 [2019-12-26 20:51:08,110 INFO L226 Difference]: Without dead ends: 30 [2019-12-26 20:51:08,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-26 20:51:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-26 20:51:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-26 20:51:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-26 20:51:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-26 20:51:08,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-26 20:51:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:08,117 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-26 20:51:08,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:51:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-26 20:51:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:51:08,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:08,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:08,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-26 20:51:08,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:08,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632695141] [2019-12-26 20:51:08,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:08,190 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-26 20:51:08,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632695141] [2019-12-26 20:51:08,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:51:08,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:51:08,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878046616] [2019-12-26 20:51:08,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:51:08,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:51:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:51:08,192 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-26 20:51:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:08,231 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-26 20:51:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:51:08,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-26 20:51:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:08,236 INFO L225 Difference]: With dead ends: 34 [2019-12-26 20:51:08,236 INFO L226 Difference]: Without dead ends: 28 [2019-12-26 20:51:08,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-26 20:51:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-26 20:51:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-26 20:51:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-26 20:51:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-26 20:51:08,246 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-26 20:51:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:08,246 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-26 20:51:08,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:51:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-26 20:51:08,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:51:08,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:08,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:08,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-26 20:51:08,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:08,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824987603] [2019-12-26 20:51:08,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:08,329 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-26 20:51:08,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824987603] [2019-12-26 20:51:08,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:51:08,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:51:08,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937867445] [2019-12-26 20:51:08,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:51:08,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:51:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:51:08,332 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-26 20:51:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:08,375 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-26 20:51:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:51:08,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-26 20:51:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:08,376 INFO L225 Difference]: With dead ends: 32 [2019-12-26 20:51:08,376 INFO L226 Difference]: Without dead ends: 28 [2019-12-26 20:51:08,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-26 20:51:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-26 20:51:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-26 20:51:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-26 20:51:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-26 20:51:08,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-26 20:51:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:08,382 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-26 20:51:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:51:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-26 20:51:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:51:08,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:08,383 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:08,384 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-26 20:51:08,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:08,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478013917] [2019-12-26 20:51:08,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:08,491 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-26 20:51:08,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478013917] [2019-12-26 20:51:08,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643890353] [2019-12-26 20:51:08,493 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-26 20:51:08,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-26 20:51:08,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:08,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-26 20:51:08,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:08,610 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-26 20:51:08,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:08,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-26 20:51:08,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975146145] [2019-12-26 20:51:08,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 20:51:08,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 20:51:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 20:51:08,614 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-26 20:51:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:08,674 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-26 20:51:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:51:08,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-26 20:51:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:08,675 INFO L225 Difference]: With dead ends: 32 [2019-12-26 20:51:08,675 INFO L226 Difference]: Without dead ends: 29 [2019-12-26 20:51:08,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:51:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-26 20:51:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-26 20:51:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-26 20:51:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-26 20:51:08,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-26 20:51:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:08,681 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-26 20:51:08,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 20:51:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-26 20:51:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:51:08,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:08,682 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:08,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:08,884 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-26 20:51:08,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:08,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339670069] [2019-12-26 20:51:08,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:08,963 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-26 20:51:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339670069] [2019-12-26 20:51:08,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097268041] [2019-12-26 20:51:08,964 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-26 20:51:09,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:09,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:09,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-26 20:51:09,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:09,051 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-26 20:51:09,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:09,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-26 20:51:09,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082708396] [2019-12-26 20:51:09,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 20:51:09,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 20:51:09,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 20:51:09,053 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-26 20:51:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:09,120 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-26 20:51:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 20:51:09,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-26 20:51:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:09,122 INFO L225 Difference]: With dead ends: 33 [2019-12-26 20:51:09,122 INFO L226 Difference]: Without dead ends: 30 [2019-12-26 20:51:09,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:51:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-26 20:51:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-26 20:51:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-26 20:51:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-26 20:51:09,127 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-26 20:51:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:09,128 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-26 20:51:09,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 20:51:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-26 20:51:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 20:51:09,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:09,129 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:09,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:09,330 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-26 20:51:09,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:09,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687140799] [2019-12-26 20:51:09,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:09,414 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-26 20:51:09,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687140799] [2019-12-26 20:51:09,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042267191] [2019-12-26 20:51:09,415 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-26 20:51:09,473 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:09,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:09,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-26 20:51:09,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:09,496 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-26 20:51:09,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:09,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-26 20:51:09,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542212852] [2019-12-26 20:51:09,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 20:51:09,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 20:51:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-26 20:51:09,498 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-26 20:51:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:09,587 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-26 20:51:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 20:51:09,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-26 20:51:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:09,589 INFO L225 Difference]: With dead ends: 34 [2019-12-26 20:51:09,589 INFO L226 Difference]: Without dead ends: 31 [2019-12-26 20:51:09,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:51:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-26 20:51:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-26 20:51:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-26 20:51:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-26 20:51:09,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-26 20:51:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:09,594 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-26 20:51:09,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 20:51:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-26 20:51:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 20:51:09,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:09,595 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:09,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:09,799 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:09,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-26 20:51:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:09,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101939737] [2019-12-26 20:51:09,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:09,890 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-26 20:51:09,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101939737] [2019-12-26 20:51:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449624385] [2019-12-26 20:51:09,891 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-26 20:51:09,934 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-26 20:51:09,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:09,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-26 20:51:09,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:09,953 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-26 20:51:09,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:09,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-26 20:51:09,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460047515] [2019-12-26 20:51:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 20:51:09,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 20:51:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-26 20:51:09,956 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-26 20:51:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:10,064 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-26 20:51:10,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 20:51:10,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-26 20:51:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:10,066 INFO L225 Difference]: With dead ends: 35 [2019-12-26 20:51:10,066 INFO L226 Difference]: Without dead ends: 32 [2019-12-26 20:51:10,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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-26 20:51:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-26 20:51:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-26 20:51:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-26 20:51:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-26 20:51:10,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-26 20:51:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:10,071 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-26 20:51:10,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 20:51:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-26 20:51:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:51:10,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:10,072 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:10,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:10,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-26 20:51:10,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:10,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290111056] [2019-12-26 20:51:10,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:10,371 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-26 20:51:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290111056] [2019-12-26 20:51:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911934138] [2019-12-26 20:51:10,372 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-26 20:51:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:10,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-26 20:51:10,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:10,464 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-26 20:51:10,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:10,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-26 20:51:10,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234775726] [2019-12-26 20:51:10,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 20:51:10,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 20:51:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:51:10,467 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-26 20:51:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:10,571 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-26 20:51:10,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 20:51:10,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-26 20:51:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:10,573 INFO L225 Difference]: With dead ends: 36 [2019-12-26 20:51:10,573 INFO L226 Difference]: Without dead ends: 33 [2019-12-26 20:51:10,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:51:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-26 20:51:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-26 20:51:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-26 20:51:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-26 20:51:10,578 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-26 20:51:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:10,578 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-26 20:51:10,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 20:51:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-26 20:51:10,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:51:10,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:10,579 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:10,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:10,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-26 20:51:10,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:10,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673102920] [2019-12-26 20:51:10,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:10,868 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-26 20:51:10,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673102920] [2019-12-26 20:51:10,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688540820] [2019-12-26 20:51:10,869 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-26 20:51:10,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:10,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:10,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-26 20:51:10,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:10,989 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-26 20:51:10,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:10,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-26 20:51:10,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586576843] [2019-12-26 20:51:10,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 20:51:10,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 20:51:10,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:51:10,992 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-26 20:51:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:11,099 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-26 20:51:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 20:51:11,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-26 20:51:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:11,100 INFO L225 Difference]: With dead ends: 37 [2019-12-26 20:51:11,100 INFO L226 Difference]: Without dead ends: 34 [2019-12-26 20:51:11,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-26 20:51:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-26 20:51:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-26 20:51:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-26 20:51:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-26 20:51:11,105 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-26 20:51:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:11,105 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-26 20:51:11,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 20:51:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-26 20:51:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:51:11,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:11,106 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:11,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:11,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-26 20:51:11,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:11,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202481187] [2019-12-26 20:51:11,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:11,378 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-26 20:51:11,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202481187] [2019-12-26 20:51:11,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019814756] [2019-12-26 20:51:11,379 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-26 20:51:11,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-26 20:51:11,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:11,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-26 20:51:11,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:11,461 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-26 20:51:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-26 20:51:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288668441] [2019-12-26 20:51:11,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 20:51:11,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 20:51:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:51:11,469 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-26 20:51:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:11,619 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-26 20:51:11,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 20:51:11,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-26 20:51:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:11,620 INFO L225 Difference]: With dead ends: 38 [2019-12-26 20:51:11,621 INFO L226 Difference]: Without dead ends: 35 [2019-12-26 20:51:11,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:51:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-26 20:51:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-26 20:51:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-26 20:51:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-26 20:51:11,626 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-26 20:51:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:11,626 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-26 20:51:11,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 20:51:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-26 20:51:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:51:11,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:11,628 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:11,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:11,829 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:11,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-26 20:51:11,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:11,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204188101] [2019-12-26 20:51:11,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:11,917 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-26 20:51:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204188101] [2019-12-26 20:51:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243128929] [2019-12-26 20:51:11,917 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-26 20:51:11,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:11,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:11,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-26 20:51:11,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:12,014 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-26 20:51:12,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:12,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-26 20:51:12,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232474769] [2019-12-26 20:51:12,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 20:51:12,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 20:51:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:51:12,016 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-26 20:51:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:12,146 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-26 20:51:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 20:51:12,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-26 20:51:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:12,147 INFO L225 Difference]: With dead ends: 39 [2019-12-26 20:51:12,147 INFO L226 Difference]: Without dead ends: 36 [2019-12-26 20:51:12,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:51:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-26 20:51:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-26 20:51:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-26 20:51:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-26 20:51:12,151 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-26 20:51:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:12,152 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-26 20:51:12,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 20:51:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-26 20:51:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 20:51:12,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:12,153 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:12,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:12,360 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-26 20:51:12,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:12,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289744899] [2019-12-26 20:51:12,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:12,430 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-26 20:51:12,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289744899] [2019-12-26 20:51:12,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092014629] [2019-12-26 20:51:12,432 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-26 20:51:12,485 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-26 20:51:12,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:12,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-26 20:51:12,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:12,513 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-26 20:51:12,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:12,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-26 20:51:12,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640886166] [2019-12-26 20:51:12,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 20:51:12,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 20:51:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-26 20:51:12,515 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-26 20:51:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:12,654 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-26 20:51:12,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 20:51:12,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-26 20:51:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:12,655 INFO L225 Difference]: With dead ends: 40 [2019-12-26 20:51:12,655 INFO L226 Difference]: Without dead ends: 37 [2019-12-26 20:51:12,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:51:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-26 20:51:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-26 20:51:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-26 20:51:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-26 20:51:12,659 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-26 20:51:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:12,659 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-26 20:51:12,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 20:51:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-26 20:51:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 20:51:12,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:12,660 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:12,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:12,867 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-26 20:51:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:12,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174742320] [2019-12-26 20:51:12,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:12,970 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-26 20:51:12,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174742320] [2019-12-26 20:51:12,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710844235] [2019-12-26 20:51:12,971 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-26 20:51:13,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-26 20:51:13,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:13,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-26 20:51:13,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:13,039 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-26 20:51:13,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:13,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-26 20:51:13,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216924709] [2019-12-26 20:51:13,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 20:51:13,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 20:51:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-26 20:51:13,041 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-26 20:51:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:13,215 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-26 20:51:13,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 20:51:13,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-26 20:51:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:13,221 INFO L225 Difference]: With dead ends: 41 [2019-12-26 20:51:13,221 INFO L226 Difference]: Without dead ends: 38 [2019-12-26 20:51:13,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-12-26 20:51:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-26 20:51:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-26 20:51:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-26 20:51:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-26 20:51:13,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-26 20:51:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:13,225 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-26 20:51:13,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 20:51:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-26 20:51:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 20:51:13,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:13,226 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:13,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:13,430 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:13,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-26 20:51:13,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:13,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713361876] [2019-12-26 20:51:13,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:13,515 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-26 20:51:13,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713361876] [2019-12-26 20:51:13,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938372656] [2019-12-26 20:51:13,516 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-26 20:51:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:13,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-26 20:51:13,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:13,598 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-26 20:51:13,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:13,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-26 20:51:13,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755231195] [2019-12-26 20:51:13,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 20:51:13,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 20:51:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:51:13,601 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-26 20:51:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:13,773 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-26 20:51:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 20:51:13,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-26 20:51:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:13,775 INFO L225 Difference]: With dead ends: 42 [2019-12-26 20:51:13,775 INFO L226 Difference]: Without dead ends: 39 [2019-12-26 20:51:13,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-26 20:51:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-26 20:51:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-26 20:51:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-26 20:51:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-26 20:51:13,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-26 20:51:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:13,780 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-26 20:51:13,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 20:51:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-26 20:51:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 20:51:13,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:13,781 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:13,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:13,984 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-26 20:51:13,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:13,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158584120] [2019-12-26 20:51:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:14,070 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-26 20:51:14,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158584120] [2019-12-26 20:51:14,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271910978] [2019-12-26 20:51:14,071 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-26 20:51:14,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:14,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:14,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-26 20:51:14,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:14,139 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-26 20:51:14,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:14,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-26 20:51:14,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716730596] [2019-12-26 20:51:14,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 20:51:14,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:14,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 20:51:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:51:14,140 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-26 20:51:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:14,335 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-26 20:51:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 20:51:14,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-26 20:51:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:14,336 INFO L225 Difference]: With dead ends: 43 [2019-12-26 20:51:14,336 INFO L226 Difference]: Without dead ends: 40 [2019-12-26 20:51:14,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-26 20:51:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-26 20:51:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-26 20:51:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-26 20:51:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-26 20:51:14,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-26 20:51:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:14,342 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-26 20:51:14,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 20:51:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-26 20:51:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 20:51:14,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:14,343 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:14,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:14,547 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-26 20:51:14,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:14,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021952726] [2019-12-26 20:51:14,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:14,631 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-26 20:51:14,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021952726] [2019-12-26 20:51:14,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390782267] [2019-12-26 20:51:14,632 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-26 20:51:14,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-26 20:51:14,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:14,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-26 20:51:14,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:14,698 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-26 20:51:14,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:14,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-26 20:51:14,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392488359] [2019-12-26 20:51:14,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 20:51:14,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 20:51:14,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:51:14,700 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-26 20:51:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:14,913 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-26 20:51:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 20:51:14,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-26 20:51:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:14,914 INFO L225 Difference]: With dead ends: 44 [2019-12-26 20:51:14,915 INFO L226 Difference]: Without dead ends: 41 [2019-12-26 20:51:14,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2019-12-26 20:51:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-26 20:51:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-26 20:51:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-26 20:51:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-26 20:51:14,919 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-26 20:51:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:14,920 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-26 20:51:14,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 20:51:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-26 20:51:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 20:51:14,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:14,921 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:15,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:15,124 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-26 20:51:15,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:15,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012785230] [2019-12-26 20:51:15,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:15,212 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-26 20:51:15,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012785230] [2019-12-26 20:51:15,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377365617] [2019-12-26 20:51:15,213 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-26 20:51:15,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:15,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:15,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-26 20:51:15,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:15,296 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-26 20:51:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:15,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-26 20:51:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234879829] [2019-12-26 20:51:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 20:51:15,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 20:51:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:51:15,299 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-26 20:51:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:15,541 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-26 20:51:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 20:51:15,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-26 20:51:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:15,543 INFO L225 Difference]: With dead ends: 45 [2019-12-26 20:51:15,543 INFO L226 Difference]: Without dead ends: 42 [2019-12-26 20:51:15,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-26 20:51:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-26 20:51:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-26 20:51:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-26 20:51:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-26 20:51:15,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-26 20:51:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:15,554 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-26 20:51:15,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 20:51:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-26 20:51:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 20:51:15,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:15,560 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:15,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:15,770 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-26 20:51:15,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:15,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202522160] [2019-12-26 20:51:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:15,870 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-26 20:51:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202522160] [2019-12-26 20:51:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292667917] [2019-12-26 20:51:15,871 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-26 20:51:15,919 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-26 20:51:15,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:15,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-26 20:51:15,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:15,943 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-26 20:51:15,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:15,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-26 20:51:15,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899138698] [2019-12-26 20:51:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 20:51:15,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 20:51:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 20:51:15,944 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 14 states. [2019-12-26 20:51:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:16,185 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-26 20:51:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 20:51:16,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-26 20:51:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:16,187 INFO L225 Difference]: With dead ends: 46 [2019-12-26 20:51:16,187 INFO L226 Difference]: Without dead ends: 43 [2019-12-26 20:51:16,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-12-26 20:51:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-26 20:51:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-26 20:51:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-26 20:51:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-26 20:51:16,190 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-26 20:51:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:16,191 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-26 20:51:16,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 20:51:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-26 20:51:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 20:51:16,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:16,191 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:16,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:16,392 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:16,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-26 20:51:16,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:16,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207786885] [2019-12-26 20:51:16,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:16,506 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-26 20:51:16,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207786885] [2019-12-26 20:51:16,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886762652] [2019-12-26 20:51:16,508 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-26 20:51:16,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-26 20:51:16,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:16,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-26 20:51:16,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:16,597 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-26 20:51:16,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:16,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-26 20:51:16,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753766504] [2019-12-26 20:51:16,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 20:51:16,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 20:51:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 20:51:16,599 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 14 states. [2019-12-26 20:51:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:16,824 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-26 20:51:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 20:51:16,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-26 20:51:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:16,826 INFO L225 Difference]: With dead ends: 47 [2019-12-26 20:51:16,826 INFO L226 Difference]: Without dead ends: 44 [2019-12-26 20:51:16,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2019-12-26 20:51:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-26 20:51:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-26 20:51:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-26 20:51:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-26 20:51:16,829 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-26 20:51:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:16,830 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-26 20:51:16,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 20:51:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-26 20:51:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 20:51:16,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:16,831 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:17,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:17,034 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-26 20:51:17,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:17,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126035204] [2019-12-26 20:51:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:17,150 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-26 20:51:17,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126035204] [2019-12-26 20:51:17,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283220425] [2019-12-26 20:51:17,151 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-26 20:51:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:17,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-26 20:51:17,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:17,222 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-26 20:51:17,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:17,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-26 20:51:17,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356896381] [2019-12-26 20:51:17,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 20:51:17,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 20:51:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-26 20:51:17,224 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 15 states. [2019-12-26 20:51:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:17,443 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-26 20:51:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 20:51:17,443 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-26 20:51:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:17,444 INFO L225 Difference]: With dead ends: 48 [2019-12-26 20:51:17,444 INFO L226 Difference]: Without dead ends: 45 [2019-12-26 20:51:17,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-12-26 20:51:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-26 20:51:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-26 20:51:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-26 20:51:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-26 20:51:17,448 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-26 20:51:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:17,449 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-26 20:51:17,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 20:51:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-26 20:51:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 20:51:17,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:17,449 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:17,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:17,653 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-26 20:51:17,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:17,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976488154] [2019-12-26 20:51:17,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:17,786 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-26 20:51:17,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976488154] [2019-12-26 20:51:17,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375713540] [2019-12-26 20:51:17,786 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-26 20:51:17,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:17,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:17,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-26 20:51:17,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:17,887 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-26 20:51:17,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:17,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-26 20:51:17,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782787599] [2019-12-26 20:51:17,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 20:51:17,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 20:51:17,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-26 20:51:17,889 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 15 states. [2019-12-26 20:51:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:18,205 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-26 20:51:18,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 20:51:18,205 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-26 20:51:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:18,206 INFO L225 Difference]: With dead ends: 49 [2019-12-26 20:51:18,206 INFO L226 Difference]: Without dead ends: 46 [2019-12-26 20:51:18,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2019-12-26 20:51:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-26 20:51:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-26 20:51:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-26 20:51:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-26 20:51:18,210 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-26 20:51:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-26 20:51:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 20:51:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-26 20:51:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 20:51:18,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:18,212 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:18,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:18,417 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-26 20:51:18,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:18,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857702355] [2019-12-26 20:51:18,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:18,553 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-26 20:51:18,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857702355] [2019-12-26 20:51:18,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989145640] [2019-12-26 20:51:18,554 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-26 20:51:18,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-26 20:51:18,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:18,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-26 20:51:18,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:18,650 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-26 20:51:18,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:18,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-26 20:51:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644202280] [2019-12-26 20:51:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 20:51:18,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 20:51:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:51:18,652 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 16 states. [2019-12-26 20:51:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:18,918 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-26 20:51:18,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 20:51:18,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-26 20:51:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:18,920 INFO L225 Difference]: With dead ends: 50 [2019-12-26 20:51:18,920 INFO L226 Difference]: Without dead ends: 47 [2019-12-26 20:51:18,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2019-12-26 20:51:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-26 20:51:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-26 20:51:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-26 20:51:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-26 20:51:18,923 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-26 20:51:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:18,923 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-26 20:51:18,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 20:51:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-26 20:51:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 20:51:18,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:18,924 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:19,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:19,128 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-26 20:51:19,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:19,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787899171] [2019-12-26 20:51:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:19,235 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-26 20:51:19,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787899171] [2019-12-26 20:51:19,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855914206] [2019-12-26 20:51:19,236 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-26 20:51:19,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:19,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:19,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-26 20:51:19,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:19,321 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-26 20:51:19,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:19,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-26 20:51:19,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523687267] [2019-12-26 20:51:19,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 20:51:19,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 20:51:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:51:19,323 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 16 states. [2019-12-26 20:51:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:19,575 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-26 20:51:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 20:51:19,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-26 20:51:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:19,576 INFO L225 Difference]: With dead ends: 51 [2019-12-26 20:51:19,576 INFO L226 Difference]: Without dead ends: 48 [2019-12-26 20:51:19,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2019-12-26 20:51:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-26 20:51:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-26 20:51:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-26 20:51:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-26 20:51:19,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-26 20:51:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:19,579 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-26 20:51:19,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 20:51:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-26 20:51:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 20:51:19,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:19,580 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:19,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:19,784 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-26 20:51:19,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:19,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185957883] [2019-12-26 20:51:19,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:19,920 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-26 20:51:19,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185957883] [2019-12-26 20:51:19,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242661866] [2019-12-26 20:51:19,921 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-26 20:51:19,967 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-26 20:51:19,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:19,969 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-26 20:51:19,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:19,985 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-26 20:51:19,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:19,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-26 20:51:19,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951731416] [2019-12-26 20:51:19,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 20:51:19,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 20:51:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:51:19,987 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 17 states. [2019-12-26 20:51:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:20,302 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-26 20:51:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 20:51:20,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-26 20:51:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:20,302 INFO L225 Difference]: With dead ends: 52 [2019-12-26 20:51:20,302 INFO L226 Difference]: Without dead ends: 49 [2019-12-26 20:51:20,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2019-12-26 20:51:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-26 20:51:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-26 20:51:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-26 20:51:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-26 20:51:20,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-26 20:51:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:20,304 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-26 20:51:20,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 20:51:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-26 20:51:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 20:51:20,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:20,305 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:20,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:20,506 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-26 20:51:20,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:20,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351673861] [2019-12-26 20:51:20,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:20,661 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-26 20:51:20,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351673861] [2019-12-26 20:51:20,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311753588] [2019-12-26 20:51:20,662 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-26 20:51:20,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-26 20:51:20,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:20,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-26 20:51:20,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:20,743 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-26 20:51:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:20,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-26 20:51:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793037210] [2019-12-26 20:51:20,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 20:51:20,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 20:51:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:51:20,745 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 17 states. [2019-12-26 20:51:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:21,043 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-26 20:51:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 20:51:21,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-26 20:51:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:21,044 INFO L225 Difference]: With dead ends: 53 [2019-12-26 20:51:21,048 INFO L226 Difference]: Without dead ends: 50 [2019-12-26 20:51:21,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=580, Unknown=0, NotChecked=0, Total=870 [2019-12-26 20:51:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-26 20:51:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-26 20:51:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-26 20:51:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-26 20:51:21,054 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-26 20:51:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:21,054 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-26 20:51:21,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 20:51:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-26 20:51:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 20:51:21,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:21,055 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:21,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:21,259 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-26 20:51:21,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:21,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584180843] [2019-12-26 20:51:21,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:21,390 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-26 20:51:21,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584180843] [2019-12-26 20:51:21,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29320577] [2019-12-26 20:51:21,391 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-26 20:51:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:21,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-26 20:51:21,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:21,480 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-26 20:51:21,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:21,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-26 20:51:21,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147191751] [2019-12-26 20:51:21,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 20:51:21,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 20:51:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-26 20:51:21,482 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 18 states. [2019-12-26 20:51:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:21,811 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-26 20:51:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 20:51:21,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-26 20:51:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:21,812 INFO L225 Difference]: With dead ends: 54 [2019-12-26 20:51:21,812 INFO L226 Difference]: Without dead ends: 51 [2019-12-26 20:51:21,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=662, Unknown=0, NotChecked=0, Total=992 [2019-12-26 20:51:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-26 20:51:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-26 20:51:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-26 20:51:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-26 20:51:21,816 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-26 20:51:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:21,816 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-26 20:51:21,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 20:51:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-26 20:51:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 20:51:21,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:21,817 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:22,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:22,020 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-26 20:51:22,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:22,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184428823] [2019-12-26 20:51:22,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:22,152 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-26 20:51:22,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184428823] [2019-12-26 20:51:22,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876883875] [2019-12-26 20:51:22,153 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-26 20:51:22,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:22,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:22,202 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-26 20:51:22,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:22,233 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-26 20:51:22,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:22,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-26 20:51:22,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704009132] [2019-12-26 20:51:22,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 20:51:22,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 20:51:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-26 20:51:22,234 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 18 states. [2019-12-26 20:51:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:22,533 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-26 20:51:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 20:51:22,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-26 20:51:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:22,535 INFO L225 Difference]: With dead ends: 55 [2019-12-26 20:51:22,535 INFO L226 Difference]: Without dead ends: 52 [2019-12-26 20:51:22,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2019-12-26 20:51:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-26 20:51:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-26 20:51:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-26 20:51:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-26 20:51:22,539 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-26 20:51:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:22,539 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-26 20:51:22,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 20:51:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-26 20:51:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 20:51:22,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:22,540 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:22,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:22,742 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-26 20:51:22,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:22,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283962455] [2019-12-26 20:51:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:22,874 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-26 20:51:22,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283962455] [2019-12-26 20:51:22,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067920822] [2019-12-26 20:51:22,875 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-26 20:51:22,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-26 20:51:22,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:22,926 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-26 20:51:22,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:22,966 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-26 20:51:22,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:22,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-26 20:51:22,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797167493] [2019-12-26 20:51:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 20:51:22,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 20:51:22,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-26 20:51:22,968 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 19 states. [2019-12-26 20:51:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:23,328 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-26 20:51:23,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 20:51:23,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-26 20:51:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:23,330 INFO L225 Difference]: With dead ends: 56 [2019-12-26 20:51:23,330 INFO L226 Difference]: Without dead ends: 53 [2019-12-26 20:51:23,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 20:51:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-26 20:51:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-26 20:51:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-26 20:51:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-26 20:51:23,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-26 20:51:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:23,334 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-26 20:51:23,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 20:51:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-26 20:51:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 20:51:23,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:23,335 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:23,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:23,538 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-26 20:51:23,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:23,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853270936] [2019-12-26 20:51:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:23,734 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-26 20:51:23,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853270936] [2019-12-26 20:51:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044053970] [2019-12-26 20:51:23,735 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-26 20:51:23,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:23,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:23,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-26 20:51:23,805 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:23,851 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-26 20:51:23,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:23,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-26 20:51:23,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707705170] [2019-12-26 20:51:23,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 20:51:23,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 20:51:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-26 20:51:23,853 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 19 states. [2019-12-26 20:51:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:24,349 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-26 20:51:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 20:51:24,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-26 20:51:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:24,350 INFO L225 Difference]: With dead ends: 57 [2019-12-26 20:51:24,350 INFO L226 Difference]: Without dead ends: 54 [2019-12-26 20:51:24,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=371, Invalid=751, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 20:51:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-26 20:51:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-26 20:51:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-26 20:51:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-26 20:51:24,354 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-26 20:51:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:24,355 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-26 20:51:24,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 20:51:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-26 20:51:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 20:51:24,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:24,356 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:24,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:24,560 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-26 20:51:24,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:24,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467480500] [2019-12-26 20:51:24,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:24,736 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-26 20:51:24,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467480500] [2019-12-26 20:51:24,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762384343] [2019-12-26 20:51:24,737 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-26 20:51:24,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-26 20:51:24,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:24,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-26 20:51:24,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:24,820 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-26 20:51:24,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:24,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-26 20:51:24,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273885161] [2019-12-26 20:51:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 20:51:24,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 20:51:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-26 20:51:24,821 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 20 states. [2019-12-26 20:51:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:25,195 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-26 20:51:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 20:51:25,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-26 20:51:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:25,196 INFO L225 Difference]: With dead ends: 58 [2019-12-26 20:51:25,196 INFO L226 Difference]: Without dead ends: 55 [2019-12-26 20:51:25,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=844, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 20:51:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-26 20:51:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-26 20:51:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-26 20:51:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-26 20:51:25,200 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-26 20:51:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:25,200 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-26 20:51:25,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 20:51:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-26 20:51:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 20:51:25,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:25,201 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:25,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:25,403 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-26 20:51:25,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:25,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458676968] [2019-12-26 20:51:25,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:25,558 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-26 20:51:25,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458676968] [2019-12-26 20:51:25,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207560632] [2019-12-26 20:51:25,559 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-26 20:51:25,628 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-26 20:51:25,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:25,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-26 20:51:25,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:25,653 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-26 20:51:25,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-26 20:51:25,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257651050] [2019-12-26 20:51:25,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 20:51:25,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 20:51:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-26 20:51:25,655 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 20 states. [2019-12-26 20:51:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:26,023 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-26 20:51:26,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 20:51:26,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-26 20:51:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:26,025 INFO L225 Difference]: With dead ends: 59 [2019-12-26 20:51:26,025 INFO L226 Difference]: Without dead ends: 56 [2019-12-26 20:51:26,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 20:51:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-26 20:51:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-26 20:51:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-26 20:51:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-26 20:51:26,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-26 20:51:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:26,029 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-26 20:51:26,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 20:51:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-26 20:51:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 20:51:26,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:26,029 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:26,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:26,230 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-26 20:51:26,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:26,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344374966] [2019-12-26 20:51:26,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:26,449 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-26 20:51:26,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344374966] [2019-12-26 20:51:26,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422451759] [2019-12-26 20:51:26,450 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-26 20:51:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:26,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-26 20:51:26,533 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:26,577 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-26 20:51:26,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:26,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-26 20:51:26,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630978498] [2019-12-26 20:51:26,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 20:51:26,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 20:51:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-26 20:51:26,580 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 21 states. [2019-12-26 20:51:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:27,091 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-26 20:51:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 20:51:27,091 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-26 20:51:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:27,092 INFO L225 Difference]: With dead ends: 60 [2019-12-26 20:51:27,092 INFO L226 Difference]: Without dead ends: 57 [2019-12-26 20:51:27,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=442, Invalid=890, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 20:51:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-26 20:51:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-26 20:51:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-26 20:51:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-26 20:51:27,095 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-26 20:51:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-26 20:51:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 20:51:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-26 20:51:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 20:51:27,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:27,097 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:27,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:27,301 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:27,301 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-26 20:51:27,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:27,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869148677] [2019-12-26 20:51:27,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:27,503 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-26 20:51:27,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869148677] [2019-12-26 20:51:27,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405548679] [2019-12-26 20:51:27,504 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-26 20:51:27,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:27,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:27,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-26 20:51:27,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:27,609 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-26 20:51:27,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:27,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-26 20:51:27,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026063854] [2019-12-26 20:51:27,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 20:51:27,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:27,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 20:51:27,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-26 20:51:27,612 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 21 states. [2019-12-26 20:51:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:28,033 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-26 20:51:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 20:51:28,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-26 20:51:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:28,034 INFO L225 Difference]: With dead ends: 61 [2019-12-26 20:51:28,034 INFO L226 Difference]: Without dead ends: 58 [2019-12-26 20:51:28,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=944, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 20:51:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-26 20:51:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-26 20:51:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-26 20:51:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-26 20:51:28,037 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-26 20:51:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:28,038 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-26 20:51:28,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 20:51:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-26 20:51:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 20:51:28,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:28,039 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:28,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:28,241 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-26 20:51:28,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:28,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247871730] [2019-12-26 20:51:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:28,449 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-26 20:51:28,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247871730] [2019-12-26 20:51:28,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924411168] [2019-12-26 20:51:28,450 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-26 20:51:28,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-26 20:51:28,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:28,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-26 20:51:28,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:28,549 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-26 20:51:28,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:28,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-26 20:51:28,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933270281] [2019-12-26 20:51:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 20:51:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 20:51:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-26 20:51:28,554 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 22 states. [2019-12-26 20:51:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:29,070 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-26 20:51:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 20:51:29,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-26 20:51:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:29,071 INFO L225 Difference]: With dead ends: 62 [2019-12-26 20:51:29,071 INFO L226 Difference]: Without dead ends: 59 [2019-12-26 20:51:29,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1048, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 20:51:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-26 20:51:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-26 20:51:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-26 20:51:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-26 20:51:29,074 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-26 20:51:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:29,074 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-26 20:51:29,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 20:51:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-26 20:51:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 20:51:29,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:29,075 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:29,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:29,276 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-26 20:51:29,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:29,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914190266] [2019-12-26 20:51:29,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:29,479 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-26 20:51:29,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914190266] [2019-12-26 20:51:29,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934569074] [2019-12-26 20:51:29,480 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-26 20:51:29,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:29,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:29,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-26 20:51:29,538 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:29,573 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-26 20:51:29,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:29,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-26 20:51:29,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764039084] [2019-12-26 20:51:29,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 20:51:29,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 20:51:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-26 20:51:29,574 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 22 states. [2019-12-26 20:51:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:30,014 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-26 20:51:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 20:51:30,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-26 20:51:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:30,016 INFO L225 Difference]: With dead ends: 63 [2019-12-26 20:51:30,016 INFO L226 Difference]: Without dead ends: 60 [2019-12-26 20:51:30,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=527, Invalid=1033, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 20:51:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-26 20:51:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-26 20:51:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-26 20:51:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-26 20:51:30,021 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-26 20:51:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:30,021 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-26 20:51:30,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 20:51:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-26 20:51:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 20:51:30,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:30,022 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:30,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:30,226 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-26 20:51:30,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:30,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676972244] [2019-12-26 20:51:30,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:30,469 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-26 20:51:30,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676972244] [2019-12-26 20:51:30,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198718868] [2019-12-26 20:51:30,469 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-26 20:51:30,525 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-26 20:51:30,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:30,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-26 20:51:30,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:30,568 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-26 20:51:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:30,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-26 20:51:30,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927865210] [2019-12-26 20:51:30,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 20:51:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 20:51:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-26 20:51:30,570 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 23 states. [2019-12-26 20:51:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:31,059 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-26 20:51:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 20:51:31,059 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-26 20:51:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:31,060 INFO L225 Difference]: With dead ends: 64 [2019-12-26 20:51:31,060 INFO L226 Difference]: Without dead ends: 61 [2019-12-26 20:51:31,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=1099, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 20:51:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-26 20:51:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-26 20:51:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-26 20:51:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-26 20:51:31,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-26 20:51:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:31,063 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-26 20:51:31,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 20:51:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-26 20:51:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 20:51:31,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:31,064 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:31,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:31,265 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-26 20:51:31,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:31,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692684672] [2019-12-26 20:51:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:31,513 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-26 20:51:31,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692684672] [2019-12-26 20:51:31,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776879828] [2019-12-26 20:51:31,514 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-26 20:51:31,633 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-26 20:51:31,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:31,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-26 20:51:31,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:31,667 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-26 20:51:31,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:31,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-26 20:51:31,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503257838] [2019-12-26 20:51:31,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 20:51:31,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:31,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 20:51:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-26 20:51:31,669 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 23 states. [2019-12-26 20:51:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:32,119 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-26 20:51:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 20:51:32,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-26 20:51:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:32,121 INFO L225 Difference]: With dead ends: 65 [2019-12-26 20:51:32,121 INFO L226 Difference]: Without dead ends: 62 [2019-12-26 20:51:32,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=563, Invalid=1159, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 20:51:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-26 20:51:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-26 20:51:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-26 20:51:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-26 20:51:32,125 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-26 20:51:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:32,125 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-26 20:51:32,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 20:51:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-26 20:51:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 20:51:32,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:32,126 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:32,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:32,330 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:32,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-26 20:51:32,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:32,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90343520] [2019-12-26 20:51:32,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:32,535 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-26 20:51:32,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90343520] [2019-12-26 20:51:32,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653522060] [2019-12-26 20:51:32,536 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-26 20:51:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:32,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-26 20:51:32,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:32,610 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-26 20:51:32,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:32,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-26 20:51:32,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140137584] [2019-12-26 20:51:32,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-26 20:51:32,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-26 20:51:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-26 20:51:32,612 INFO L87 Difference]: Start difference. First operand 62 states and 126 transitions. Second operand 24 states. [2019-12-26 20:51:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:33,112 INFO L93 Difference]: Finished difference Result 66 states and 134 transitions. [2019-12-26 20:51:33,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 20:51:33,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-26 20:51:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:33,113 INFO L225 Difference]: With dead ends: 66 [2019-12-26 20:51:33,114 INFO L226 Difference]: Without dead ends: 63 [2019-12-26 20:51:33,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 20:51:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-26 20:51:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-12-26 20:51:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-26 20:51:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-26 20:51:33,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 27 [2019-12-26 20:51:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:33,117 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-26 20:51:33,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-26 20:51:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-26 20:51:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 20:51:33,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:33,118 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:33,320 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:33,322 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -698357774, now seen corresponding path program 38 times [2019-12-26 20:51:33,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:33,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159986158] [2019-12-26 20:51:33,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:33,562 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-26 20:51:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159986158] [2019-12-26 20:51:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517583738] [2019-12-26 20:51:33,563 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-26 20:51:33,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:33,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:33,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-26 20:51:33,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:33,648 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-26 20:51:33,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:33,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-26 20:51:33,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782107793] [2019-12-26 20:51:33,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-26 20:51:33,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-26 20:51:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-26 20:51:33,651 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 24 states. [2019-12-26 20:51:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:34,136 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2019-12-26 20:51:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 20:51:34,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-26 20:51:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:34,142 INFO L225 Difference]: With dead ends: 67 [2019-12-26 20:51:34,142 INFO L226 Difference]: Without dead ends: 64 [2019-12-26 20:51:34,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=635, Invalid=1257, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 20:51:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-26 20:51:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-26 20:51:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-26 20:51:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 130 transitions. [2019-12-26 20:51:34,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 130 transitions. Word has length 27 [2019-12-26 20:51:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:34,145 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 130 transitions. [2019-12-26 20:51:34,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-26 20:51:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 130 transitions. [2019-12-26 20:51:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 20:51:34,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:34,146 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:34,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:34,347 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1697011851, now seen corresponding path program 39 times [2019-12-26 20:51:34,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:34,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199536251] [2019-12-26 20:51:34,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:34,560 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-26 20:51:34,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199536251] [2019-12-26 20:51:34,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022848461] [2019-12-26 20:51:34,561 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-26 20:51:34,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-26 20:51:34,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:34,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-26 20:51:34,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:34,668 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-26 20:51:34,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:34,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-26 20:51:34,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767677802] [2019-12-26 20:51:34,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-26 20:51:34,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-26 20:51:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-26 20:51:34,670 INFO L87 Difference]: Start difference. First operand 64 states and 130 transitions. Second operand 25 states. [2019-12-26 20:51:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:35,178 INFO L93 Difference]: Finished difference Result 68 states and 138 transitions. [2019-12-26 20:51:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 20:51:35,179 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-26 20:51:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:35,180 INFO L225 Difference]: With dead ends: 68 [2019-12-26 20:51:35,180 INFO L226 Difference]: Without dead ends: 65 [2019-12-26 20:51:35,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=1440, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 20:51:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-26 20:51:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-12-26 20:51:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-26 20:51:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-26 20:51:35,184 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 28 [2019-12-26 20:51:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:35,184 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-26 20:51:35,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-26 20:51:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-26 20:51:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 20:51:35,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:35,185 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:35,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:35,386 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -174254209, now seen corresponding path program 40 times [2019-12-26 20:51:35,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:35,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053642860] [2019-12-26 20:51:35,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:35,612 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-26 20:51:35,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053642860] [2019-12-26 20:51:35,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360733620] [2019-12-26 20:51:35,613 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-26 20:51:35,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:35,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:35,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-26 20:51:35,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:35,691 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-26 20:51:35,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:35,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-26 20:51:35,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341241999] [2019-12-26 20:51:35,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-26 20:51:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-26 20:51:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-26 20:51:35,693 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 25 states. [2019-12-26 20:51:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:36,226 INFO L93 Difference]: Finished difference Result 69 states and 140 transitions. [2019-12-26 20:51:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 20:51:36,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-26 20:51:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:36,228 INFO L225 Difference]: With dead ends: 69 [2019-12-26 20:51:36,228 INFO L226 Difference]: Without dead ends: 66 [2019-12-26 20:51:36,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=674, Invalid=1396, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 20:51:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-26 20:51:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-26 20:51:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-26 20:51:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-26 20:51:36,232 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 28 [2019-12-26 20:51:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:36,232 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-26 20:51:36,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-26 20:51:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-26 20:51:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 20:51:36,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:36,233 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:36,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:36,436 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1067760134, now seen corresponding path program 41 times [2019-12-26 20:51:36,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:36,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67631645] [2019-12-26 20:51:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:36,648 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-26 20:51:36,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67631645] [2019-12-26 20:51:36,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333547890] [2019-12-26 20:51:36,649 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-26 20:51:36,704 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-26 20:51:36,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:36,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-26 20:51:36,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:36,741 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-26 20:51:36,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:36,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-26 20:51:36,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439781291] [2019-12-26 20:51:36,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-26 20:51:36,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-26 20:51:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-26 20:51:36,743 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 26 states. [2019-12-26 20:51:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:37,366 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2019-12-26 20:51:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 20:51:37,367 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-26 20:51:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:37,367 INFO L225 Difference]: With dead ends: 70 [2019-12-26 20:51:37,368 INFO L226 Difference]: Without dead ends: 67 [2019-12-26 20:51:37,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=734, Invalid=1522, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 20:51:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-26 20:51:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2019-12-26 20:51:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-26 20:51:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 84 transitions. [2019-12-26 20:51:37,370 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 84 transitions. Word has length 29 [2019-12-26 20:51:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:37,372 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 84 transitions. [2019-12-26 20:51:37,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-26 20:51:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 84 transitions. [2019-12-26 20:51:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 20:51:37,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:37,373 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:37,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:37,577 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1106913126, now seen corresponding path program 42 times [2019-12-26 20:51:37,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:37,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198395020] [2019-12-26 20:51:37,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:37,850 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-26 20:51:37,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198395020] [2019-12-26 20:51:37,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106709264] [2019-12-26 20:51:37,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 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-26 20:51:37,920 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-26 20:51:37,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:37,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-26 20:51:37,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:37,949 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-26 20:51:37,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:37,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-26 20:51:37,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882523991] [2019-12-26 20:51:37,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-26 20:51:37,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-26 20:51:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-26 20:51:37,951 INFO L87 Difference]: Start difference. First operand 41 states and 84 transitions. Second operand 26 states. [2019-12-26 20:51:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:38,669 INFO L93 Difference]: Finished difference Result 71 states and 144 transitions. [2019-12-26 20:51:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 20:51:38,670 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-26 20:51:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:38,671 INFO L225 Difference]: With dead ends: 71 [2019-12-26 20:51:38,671 INFO L226 Difference]: Without dead ends: 68 [2019-12-26 20:51:38,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=677, Invalid=1579, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 20:51:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-26 20:51:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-26 20:51:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-26 20:51:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 138 transitions. [2019-12-26 20:51:38,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 138 transitions. Word has length 29 [2019-12-26 20:51:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:38,676 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 138 transitions. [2019-12-26 20:51:38,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-26 20:51:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 138 transitions. [2019-12-26 20:51:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 20:51:38,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:38,678 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:38,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:38,883 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:38,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1259174157, now seen corresponding path program 43 times [2019-12-26 20:51:38,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116741752] [2019-12-26 20:51:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:39,230 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-26 20:51:39,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116741752] [2019-12-26 20:51:39,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695557930] [2019-12-26 20:51:39,231 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-26 20:51:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:39,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-26 20:51:39,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:39,316 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-26 20:51:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:39,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-26 20:51:39,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981185615] [2019-12-26 20:51:39,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-26 20:51:39,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-26 20:51:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-26 20:51:39,318 INFO L87 Difference]: Start difference. First operand 68 states and 138 transitions. Second operand 27 states. [2019-12-26 20:51:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:39,954 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2019-12-26 20:51:39,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 20:51:39,959 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-26 20:51:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:39,960 INFO L225 Difference]: With dead ends: 72 [2019-12-26 20:51:39,960 INFO L226 Difference]: Without dead ends: 69 [2019-12-26 20:51:39,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=769, Invalid=1583, Unknown=0, NotChecked=0, Total=2352 [2019-12-26 20:51:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-26 20:51:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-12-26 20:51:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-26 20:51:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-26 20:51:39,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 30 [2019-12-26 20:51:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:39,964 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-26 20:51:39,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-26 20:51:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-26 20:51:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 20:51:39,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:39,965 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:40,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:40,169 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 45431767, now seen corresponding path program 44 times [2019-12-26 20:51:40,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:40,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760146809] [2019-12-26 20:51:40,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:40,404 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-26 20:51:40,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760146809] [2019-12-26 20:51:40,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835119710] [2019-12-26 20:51:40,405 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-26 20:51:40,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:40,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:40,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-26 20:51:40,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:40,491 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-26 20:51:40,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:40,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-26 20:51:40,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415183129] [2019-12-26 20:51:40,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-26 20:51:40,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-26 20:51:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-26 20:51:40,493 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 27 states. [2019-12-26 20:51:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:41,088 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-26 20:51:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 20:51:41,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-26 20:51:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:41,089 INFO L225 Difference]: With dead ends: 73 [2019-12-26 20:51:41,089 INFO L226 Difference]: Without dead ends: 70 [2019-12-26 20:51:41,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=795, Invalid=1655, Unknown=0, NotChecked=0, Total=2450 [2019-12-26 20:51:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-26 20:51:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-26 20:51:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-26 20:51:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2019-12-26 20:51:41,095 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 30 [2019-12-26 20:51:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:41,095 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2019-12-26 20:51:41,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-26 20:51:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2019-12-26 20:51:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 20:51:41,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:41,096 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:41,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:41,299 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -379692898, now seen corresponding path program 45 times [2019-12-26 20:51:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:41,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420168091] [2019-12-26 20:51:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:41,563 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-26 20:51:41,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420168091] [2019-12-26 20:51:41,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068987471] [2019-12-26 20:51:41,564 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-26 20:51:41,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-26 20:51:41,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:41,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-26 20:51:41,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:41,648 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-26 20:51:41,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:41,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-26 20:51:41,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562643332] [2019-12-26 20:51:41,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-26 20:51:41,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-26 20:51:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-26 20:51:41,651 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand 28 states. [2019-12-26 20:51:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:42,304 INFO L93 Difference]: Finished difference Result 74 states and 150 transitions. [2019-12-26 20:51:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 20:51:42,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-26 20:51:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:42,306 INFO L225 Difference]: With dead ends: 74 [2019-12-26 20:51:42,306 INFO L226 Difference]: Without dead ends: 71 [2019-12-26 20:51:42,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=860, Invalid=1792, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 20:51:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-26 20:51:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2019-12-26 20:51:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-26 20:51:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 88 transitions. [2019-12-26 20:51:42,310 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 88 transitions. Word has length 31 [2019-12-26 20:51:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:42,310 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 88 transitions. [2019-12-26 20:51:42,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-26 20:51:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 88 transitions. [2019-12-26 20:51:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 20:51:42,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:42,311 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:42,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:42,511 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1408384834, now seen corresponding path program 46 times [2019-12-26 20:51:42,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:42,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580139230] [2019-12-26 20:51:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:42,767 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-26 20:51:42,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580139230] [2019-12-26 20:51:42,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398632936] [2019-12-26 20:51:42,768 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-26 20:51:42,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:42,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:42,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-26 20:51:42,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:42,839 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-26 20:51:42,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:42,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-26 20:51:42,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329039131] [2019-12-26 20:51:42,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-26 20:51:42,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-26 20:51:42,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-26 20:51:42,841 INFO L87 Difference]: Start difference. First operand 43 states and 88 transitions. Second operand 28 states. [2019-12-26 20:51:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:43,484 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-26 20:51:43,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 20:51:43,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-26 20:51:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:43,485 INFO L225 Difference]: With dead ends: 75 [2019-12-26 20:51:43,485 INFO L226 Difference]: Without dead ends: 72 [2019-12-26 20:51:43,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=881, Invalid=1771, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 20:51:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-26 20:51:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-26 20:51:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-26 20:51:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2019-12-26 20:51:43,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 31 [2019-12-26 20:51:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:43,489 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2019-12-26 20:51:43,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-26 20:51:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2019-12-26 20:51:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 20:51:43,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:43,490 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:43,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:43,693 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1114422107, now seen corresponding path program 47 times [2019-12-26 20:51:43,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:43,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354378488] [2019-12-26 20:51:43,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:43,961 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-26 20:51:43,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354378488] [2019-12-26 20:51:43,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251169101] [2019-12-26 20:51:43,962 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-26 20:51:44,028 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-26 20:51:44,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:44,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-26 20:51:44,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:44,049 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-26 20:51:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-26 20:51:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466879603] [2019-12-26 20:51:44,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-26 20:51:44,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-26 20:51:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-26 20:51:44,051 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand 29 states. [2019-12-26 20:51:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:44,745 INFO L93 Difference]: Finished difference Result 76 states and 154 transitions. [2019-12-26 20:51:44,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 20:51:44,746 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-26 20:51:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:44,747 INFO L225 Difference]: With dead ends: 76 [2019-12-26 20:51:44,747 INFO L226 Difference]: Without dead ends: 73 [2019-12-26 20:51:44,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=898, Invalid=1858, Unknown=0, NotChecked=0, Total=2756 [2019-12-26 20:51:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-26 20:51:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-12-26 20:51:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-26 20:51:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-26 20:51:44,750 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 32 [2019-12-26 20:51:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:44,751 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-26 20:51:44,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-26 20:51:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-26 20:51:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 20:51:44,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:44,751 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:44,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:44,954 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:44,955 INFO L82 PathProgramCache]: Analyzing trace with hash 710257199, now seen corresponding path program 48 times [2019-12-26 20:51:44,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:44,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669891940] [2019-12-26 20:51:44,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:45,247 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-26 20:51:45,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669891940] [2019-12-26 20:51:45,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428093930] [2019-12-26 20:51:45,248 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-26 20:51:45,316 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-26 20:51:45,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:45,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-26 20:51:45,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:45,348 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-26 20:51:45,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:45,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-26 20:51:45,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035276635] [2019-12-26 20:51:45,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-26 20:51:45,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:45,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-26 20:51:45,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-26 20:51:45,350 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 29 states. [2019-12-26 20:51:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:46,011 INFO L93 Difference]: Finished difference Result 77 states and 156 transitions. [2019-12-26 20:51:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 20:51:46,012 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-26 20:51:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:46,013 INFO L225 Difference]: With dead ends: 77 [2019-12-26 20:51:46,013 INFO L226 Difference]: Without dead ends: 74 [2019-12-26 20:51:46,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=926, Invalid=1936, Unknown=0, NotChecked=0, Total=2862 [2019-12-26 20:51:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-26 20:51:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-26 20:51:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-26 20:51:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 150 transitions. [2019-12-26 20:51:46,017 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 150 transitions. Word has length 32 [2019-12-26 20:51:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:46,017 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 150 transitions. [2019-12-26 20:51:46,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-26 20:51:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 150 transitions. [2019-12-26 20:51:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 20:51:46,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:46,018 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:46,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:46,221 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 187347254, now seen corresponding path program 49 times [2019-12-26 20:51:46,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:46,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987616533] [2019-12-26 20:51:46,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:46,509 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-26 20:51:46,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987616533] [2019-12-26 20:51:46,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796978222] [2019-12-26 20:51:46,509 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-26 20:51:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:46,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-26 20:51:46,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:46,612 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-26 20:51:46,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:46,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-26 20:51:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517980264] [2019-12-26 20:51:46,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-26 20:51:46,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-26 20:51:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-26 20:51:46,614 INFO L87 Difference]: Start difference. First operand 74 states and 150 transitions. Second operand 30 states. [2019-12-26 20:51:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:47,357 INFO L93 Difference]: Finished difference Result 78 states and 158 transitions. [2019-12-26 20:51:47,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 20:51:47,358 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-26 20:51:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:47,359 INFO L225 Difference]: With dead ends: 78 [2019-12-26 20:51:47,359 INFO L226 Difference]: Without dead ends: 75 [2019-12-26 20:51:47,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=996, Invalid=2084, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 20:51:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-26 20:51:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2019-12-26 20:51:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-26 20:51:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2019-12-26 20:51:47,362 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 33 [2019-12-26 20:51:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:47,362 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2019-12-26 20:51:47,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-26 20:51:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2019-12-26 20:51:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 20:51:47,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:47,363 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:47,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:47,567 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash 543136746, now seen corresponding path program 50 times [2019-12-26 20:51:47,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:47,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602265408] [2019-12-26 20:51:47,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:47,839 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-26 20:51:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602265408] [2019-12-26 20:51:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805214221] [2019-12-26 20:51:47,840 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-26 20:51:47,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:47,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:47,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-26 20:51:47,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:47,920 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-26 20:51:47,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:47,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-26 20:51:47,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21192530] [2019-12-26 20:51:47,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-26 20:51:47,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-26 20:51:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-26 20:51:47,922 INFO L87 Difference]: Start difference. First operand 45 states and 92 transitions. Second operand 30 states. [2019-12-26 20:51:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:48,634 INFO L93 Difference]: Finished difference Result 79 states and 160 transitions. [2019-12-26 20:51:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 20:51:48,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-26 20:51:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:48,636 INFO L225 Difference]: With dead ends: 79 [2019-12-26 20:51:48,636 INFO L226 Difference]: Without dead ends: 76 [2019-12-26 20:51:48,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1019, Invalid=2061, Unknown=0, NotChecked=0, Total=3080 [2019-12-26 20:51:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-26 20:51:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-26 20:51:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-26 20:51:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-26 20:51:48,639 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 33 [2019-12-26 20:51:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:48,640 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-26 20:51:48,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-26 20:51:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-26 20:51:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 20:51:48,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:48,640 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:48,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:48,843 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:48,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1512797635, now seen corresponding path program 51 times [2019-12-26 20:51:48,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:48,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185154704] [2019-12-26 20:51:48,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:49,292 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-26 20:51:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185154704] [2019-12-26 20:51:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888522303] [2019-12-26 20:51:49,293 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-26 20:51:49,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-26 20:51:49,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:49,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-26 20:51:49,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:49,456 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-26 20:51:49,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:49,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-26 20:51:49,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720761489] [2019-12-26 20:51:49,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-26 20:51:49,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-26 20:51:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-26 20:51:49,458 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 31 states. [2019-12-26 20:51:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:50,451 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2019-12-26 20:51:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 20:51:50,451 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-26 20:51:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:50,452 INFO L225 Difference]: With dead ends: 80 [2019-12-26 20:51:50,453 INFO L226 Difference]: Without dead ends: 77 [2019-12-26 20:51:50,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=2316, Unknown=0, NotChecked=0, Total=3306 [2019-12-26 20:51:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-26 20:51:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2019-12-26 20:51:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-26 20:51:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-26 20:51:50,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 34 [2019-12-26 20:51:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:50,456 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-26 20:51:50,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-26 20:51:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-26 20:51:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 20:51:50,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:50,457 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:50,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:50,660 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:50,661 INFO L82 PathProgramCache]: Analyzing trace with hash -342629753, now seen corresponding path program 52 times [2019-12-26 20:51:50,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:50,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795487486] [2019-12-26 20:51:50,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:50,998 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-26 20:51:50,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795487486] [2019-12-26 20:51:50,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278577816] [2019-12-26 20:51:50,999 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-26 20:51:51,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:51,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:51,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-26 20:51:51,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:51,092 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-26 20:51:51,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:51,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-26 20:51:51,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276921907] [2019-12-26 20:51:51,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-26 20:51:51,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-26 20:51:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-26 20:51:51,094 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 31 states. [2019-12-26 20:51:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:51,848 INFO L93 Difference]: Finished difference Result 81 states and 164 transitions. [2019-12-26 20:51:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 20:51:51,853 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-26 20:51:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:51,854 INFO L225 Difference]: With dead ends: 81 [2019-12-26 20:51:51,854 INFO L226 Difference]: Without dead ends: 78 [2019-12-26 20:51:51,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1067, Invalid=2239, Unknown=0, NotChecked=0, Total=3306 [2019-12-26 20:51:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-26 20:51:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-26 20:51:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-26 20:51:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2019-12-26 20:51:51,857 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 34 [2019-12-26 20:51:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:51,857 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 158 transitions. [2019-12-26 20:51:51,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-26 20:51:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 158 transitions. [2019-12-26 20:51:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 20:51:51,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:51,858 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:52,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:52,061 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -347913266, now seen corresponding path program 53 times [2019-12-26 20:51:52,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:52,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890641073] [2019-12-26 20:51:52,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:52,364 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-26 20:51:52,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890641073] [2019-12-26 20:51:52,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419762025] [2019-12-26 20:51:52,365 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-26 20:51:52,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-12-26 20:51:52,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:52,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-26 20:51:52,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:52,478 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-26 20:51:52,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:52,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-26 20:51:52,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281885964] [2019-12-26 20:51:52,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-26 20:51:52,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-26 20:51:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-26 20:51:52,480 INFO L87 Difference]: Start difference. First operand 78 states and 158 transitions. Second operand 32 states. [2019-12-26 20:51:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:53,272 INFO L93 Difference]: Finished difference Result 82 states and 166 transitions. [2019-12-26 20:51:53,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 20:51:53,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-26 20:51:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:53,273 INFO L225 Difference]: With dead ends: 82 [2019-12-26 20:51:53,274 INFO L226 Difference]: Without dead ends: 79 [2019-12-26 20:51:53,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1142, Invalid=2398, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 20:51:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-26 20:51:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2019-12-26 20:51:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-26 20:51:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 96 transitions. [2019-12-26 20:51:53,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 96 transitions. Word has length 35 [2019-12-26 20:51:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:53,276 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 96 transitions. [2019-12-26 20:51:53,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-26 20:51:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. [2019-12-26 20:51:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 20:51:53,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:53,277 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:53,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:53,478 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2031587694, now seen corresponding path program 54 times [2019-12-26 20:51:53,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:53,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400119367] [2019-12-26 20:51:53,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:53,803 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-26 20:51:53,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400119367] [2019-12-26 20:51:53,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550029370] [2019-12-26 20:51:53,804 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-26 20:51:53,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-12-26 20:51:53,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:53,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-26 20:51:53,880 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:53,929 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-26 20:51:53,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:53,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-26 20:51:53,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086580906] [2019-12-26 20:51:53,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-26 20:51:53,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-26 20:51:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-26 20:51:53,931 INFO L87 Difference]: Start difference. First operand 47 states and 96 transitions. Second operand 32 states. [2019-12-26 20:51:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:54,702 INFO L93 Difference]: Finished difference Result 83 states and 168 transitions. [2019-12-26 20:51:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 20:51:54,702 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-26 20:51:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:54,703 INFO L225 Difference]: With dead ends: 83 [2019-12-26 20:51:54,703 INFO L226 Difference]: Without dead ends: 80 [2019-12-26 20:51:54,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1167, Invalid=2373, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 20:51:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-26 20:51:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-26 20:51:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-26 20:51:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 162 transitions. [2019-12-26 20:51:54,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 162 transitions. Word has length 35 [2019-12-26 20:51:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:54,708 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 162 transitions. [2019-12-26 20:51:54,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-26 20:51:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 162 transitions. [2019-12-26 20:51:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 20:51:54,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:54,709 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:54,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:54,912 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2099590699, now seen corresponding path program 55 times [2019-12-26 20:51:54,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:54,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130804698] [2019-12-26 20:51:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:55,242 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-26 20:51:55,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130804698] [2019-12-26 20:51:55,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514269600] [2019-12-26 20:51:55,243 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-26 20:51:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:55,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-26 20:51:55,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:55,329 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-26 20:51:55,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:55,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-26 20:51:55,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316622251] [2019-12-26 20:51:55,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-26 20:51:55,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-26 20:51:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 20:51:55,331 INFO L87 Difference]: Start difference. First operand 80 states and 162 transitions. Second operand 33 states. [2019-12-26 20:51:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:56,198 INFO L93 Difference]: Finished difference Result 84 states and 170 transitions. [2019-12-26 20:51:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 20:51:56,199 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-26 20:51:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:56,200 INFO L225 Difference]: With dead ends: 84 [2019-12-26 20:51:56,200 INFO L226 Difference]: Without dead ends: 81 [2019-12-26 20:51:56,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1186, Invalid=2474, Unknown=0, NotChecked=0, Total=3660 [2019-12-26 20:51:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-26 20:51:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2019-12-26 20:51:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-26 20:51:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-26 20:51:56,203 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 36 [2019-12-26 20:51:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-26 20:51:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-26 20:51:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-26 20:51:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 20:51:56,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:56,204 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:56,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:56,405 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1445291231, now seen corresponding path program 56 times [2019-12-26 20:51:56,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:56,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615893629] [2019-12-26 20:51:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:56,737 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-26 20:51:56,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615893629] [2019-12-26 20:51:56,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297643252] [2019-12-26 20:51:56,738 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-26 20:51:56,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:56,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:56,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-26 20:51:56,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:56,832 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-26 20:51:56,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:56,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-26 20:51:56,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027555229] [2019-12-26 20:51:56,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-26 20:51:56,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-26 20:51:56,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 20:51:56,834 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 33 states. [2019-12-26 20:51:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:57,659 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2019-12-26 20:51:57,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 20:51:57,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-26 20:51:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:57,660 INFO L225 Difference]: With dead ends: 85 [2019-12-26 20:51:57,660 INFO L226 Difference]: Without dead ends: 82 [2019-12-26 20:51:57,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1218, Invalid=2564, Unknown=0, NotChecked=0, Total=3782 [2019-12-26 20:51:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-26 20:51:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-26 20:51:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-26 20:51:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 166 transitions. [2019-12-26 20:51:57,664 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 166 transitions. Word has length 36 [2019-12-26 20:51:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:57,665 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 166 transitions. [2019-12-26 20:51:57,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-26 20:51:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 166 transitions. [2019-12-26 20:51:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 20:51:57,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:57,666 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:57,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:57,869 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 662802534, now seen corresponding path program 57 times [2019-12-26 20:51:57,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:57,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420959743] [2019-12-26 20:51:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:58,241 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-26 20:51:58,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420959743] [2019-12-26 20:51:58,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903189598] [2019-12-26 20:51:58,242 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-26 20:51:58,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-26 20:51:58,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:58,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-26 20:51:58,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:58,361 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-26 20:51:58,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:58,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-26 20:51:58,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484543417] [2019-12-26 20:51:58,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-26 20:51:58,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-26 20:51:58,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 20:51:58,363 INFO L87 Difference]: Start difference. First operand 82 states and 166 transitions. Second operand 34 states. [2019-12-26 20:51:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:59,222 INFO L93 Difference]: Finished difference Result 86 states and 174 transitions. [2019-12-26 20:51:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 20:51:59,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-26 20:51:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:59,224 INFO L225 Difference]: With dead ends: 86 [2019-12-26 20:51:59,224 INFO L226 Difference]: Without dead ends: 83 [2019-12-26 20:51:59,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1298, Invalid=2734, Unknown=0, NotChecked=0, Total=4032 [2019-12-26 20:51:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-26 20:51:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2019-12-26 20:51:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-26 20:51:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2019-12-26 20:51:59,228 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 100 transitions. Word has length 37 [2019-12-26 20:51:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 100 transitions. [2019-12-26 20:51:59,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-26 20:51:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 100 transitions. [2019-12-26 20:51:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 20:51:59,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:59,229 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:59,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:59,433 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1854355258, now seen corresponding path program 58 times [2019-12-26 20:51:59,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:59,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745726736] [2019-12-26 20:51:59,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:59,867 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-26 20:51:59,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745726736] [2019-12-26 20:51:59,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724642944] [2019-12-26 20:51:59,868 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-26 20:51:59,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:59,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:59,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-26 20:51:59,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:59,996 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-26 20:51:59,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:59,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-26 20:51:59,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138944976] [2019-12-26 20:51:59,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-26 20:51:59,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-26 20:51:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 20:51:59,998 INFO L87 Difference]: Start difference. First operand 49 states and 100 transitions. Second operand 34 states. [2019-12-26 20:52:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:00,883 INFO L93 Difference]: Finished difference Result 87 states and 176 transitions. [2019-12-26 20:52:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 20:52:00,883 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-26 20:52:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:00,885 INFO L225 Difference]: With dead ends: 87 [2019-12-26 20:52:00,885 INFO L226 Difference]: Without dead ends: 84 [2019-12-26 20:52:00,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1325, Invalid=2707, Unknown=0, NotChecked=0, Total=4032 [2019-12-26 20:52:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-26 20:52:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-26 20:52:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-26 20:52:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 170 transitions. [2019-12-26 20:52:00,889 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 170 transitions. Word has length 37 [2019-12-26 20:52:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:00,889 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 170 transitions. [2019-12-26 20:52:00,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-26 20:52:00,889 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 170 transitions. [2019-12-26 20:52:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 20:52:00,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:00,890 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:01,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:01,094 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -927957869, now seen corresponding path program 59 times [2019-12-26 20:52:01,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:01,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374662886] [2019-12-26 20:52:01,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:01,463 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-26 20:52:01,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374662886] [2019-12-26 20:52:01,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634295532] [2019-12-26 20:52:01,464 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-26 20:52:01,536 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-26 20:52:01,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:01,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-26 20:52:01,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:01,583 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-26 20:52:01,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:01,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-26 20:52:01,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484686339] [2019-12-26 20:52:01,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-26 20:52:01,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-26 20:52:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 20:52:01,585 INFO L87 Difference]: Start difference. First operand 84 states and 170 transitions. Second operand 35 states. [2019-12-26 20:52:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:02,495 INFO L93 Difference]: Finished difference Result 88 states and 178 transitions. [2019-12-26 20:52:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 20:52:02,496 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-26 20:52:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:02,497 INFO L225 Difference]: With dead ends: 88 [2019-12-26 20:52:02,497 INFO L226 Difference]: Without dead ends: 85 [2019-12-26 20:52:02,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1345, Invalid=2815, Unknown=0, NotChecked=0, Total=4160 [2019-12-26 20:52:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-26 20:52:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-12-26 20:52:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-26 20:52:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-26 20:52:02,501 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 38 [2019-12-26 20:52:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:02,501 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-26 20:52:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-26 20:52:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-26 20:52:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 20:52:02,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:02,502 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:02,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:02,705 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1650438455, now seen corresponding path program 60 times [2019-12-26 20:52:02,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:02,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424092096] [2019-12-26 20:52:02,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:03,064 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-26 20:52:03,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424092096] [2019-12-26 20:52:03,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266620499] [2019-12-26 20:52:03,065 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-26 20:52:03,139 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-12-26 20:52:03,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:03,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-26 20:52:03,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:03,164 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-26 20:52:03,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:03,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-26 20:52:03,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468671664] [2019-12-26 20:52:03,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-26 20:52:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-26 20:52:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 20:52:03,165 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 35 states. [2019-12-26 20:52:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:04,251 INFO L93 Difference]: Finished difference Result 89 states and 180 transitions. [2019-12-26 20:52:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 20:52:04,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-26 20:52:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:04,252 INFO L225 Difference]: With dead ends: 89 [2019-12-26 20:52:04,252 INFO L226 Difference]: Without dead ends: 86 [2019-12-26 20:52:04,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1379, Invalid=2911, Unknown=0, NotChecked=0, Total=4290 [2019-12-26 20:52:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-26 20:52:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-26 20:52:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-26 20:52:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 174 transitions. [2019-12-26 20:52:04,256 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 174 transitions. Word has length 38 [2019-12-26 20:52:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:04,256 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 174 transitions. [2019-12-26 20:52:04,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-26 20:52:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 174 transitions. [2019-12-26 20:52:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 20:52:04,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:04,257 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:04,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:04,461 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1298077438, now seen corresponding path program 61 times [2019-12-26 20:52:04,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:04,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615996354] [2019-12-26 20:52:04,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:05,109 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-26 20:52:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615996354] [2019-12-26 20:52:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282570465] [2019-12-26 20:52:05,110 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-26 20:52:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:05,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-26 20:52:05,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:05,279 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-26 20:52:05,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:05,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-26 20:52:05,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252465210] [2019-12-26 20:52:05,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-26 20:52:05,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:05,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-26 20:52:05,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 20:52:05,283 INFO L87 Difference]: Start difference. First operand 86 states and 174 transitions. Second operand 36 states. [2019-12-26 20:52:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:06,388 INFO L93 Difference]: Finished difference Result 90 states and 182 transitions. [2019-12-26 20:52:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 20:52:06,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-26 20:52:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:06,390 INFO L225 Difference]: With dead ends: 90 [2019-12-26 20:52:06,390 INFO L226 Difference]: Without dead ends: 87 [2019-12-26 20:52:06,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1464, Invalid=3092, Unknown=0, NotChecked=0, Total=4556 [2019-12-26 20:52:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-26 20:52:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2019-12-26 20:52:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-26 20:52:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2019-12-26 20:52:06,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 39 [2019-12-26 20:52:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:06,393 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2019-12-26 20:52:06,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-26 20:52:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2019-12-26 20:52:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 20:52:06,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:06,394 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:06,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:06,595 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash -376015390, now seen corresponding path program 62 times [2019-12-26 20:52:06,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:06,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473510407] [2019-12-26 20:52:06,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:07,005 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-26 20:52:07,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473510407] [2019-12-26 20:52:07,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795309861] [2019-12-26 20:52:07,006 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-26 20:52:07,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:52:07,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:07,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-26 20:52:07,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:07,102 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-26 20:52:07,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:07,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-26 20:52:07,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045095548] [2019-12-26 20:52:07,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-26 20:52:07,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-26 20:52:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 20:52:07,103 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand 36 states. [2019-12-26 20:52:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:08,066 INFO L93 Difference]: Finished difference Result 91 states and 184 transitions. [2019-12-26 20:52:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 20:52:08,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-26 20:52:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:08,068 INFO L225 Difference]: With dead ends: 91 [2019-12-26 20:52:08,068 INFO L226 Difference]: Without dead ends: 88 [2019-12-26 20:52:08,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1342, Invalid=3214, Unknown=0, NotChecked=0, Total=4556 [2019-12-26 20:52:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-26 20:52:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-26 20:52:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-26 20:52:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 178 transitions. [2019-12-26 20:52:08,072 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 178 transitions. Word has length 39 [2019-12-26 20:52:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:08,072 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 178 transitions. [2019-12-26 20:52:08,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-26 20:52:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 178 transitions. [2019-12-26 20:52:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 20:52:08,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:08,073 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:08,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:08,275 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1585694971, now seen corresponding path program 63 times [2019-12-26 20:52:08,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:08,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133597217] [2019-12-26 20:52:08,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:08,881 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-26 20:52:08,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133597217] [2019-12-26 20:52:08,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473816392] [2019-12-26 20:52:08,882 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-26 20:52:08,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-12-26 20:52:08,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:08,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-26 20:52:08,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:08,994 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-26 20:52:08,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:08,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-26 20:52:08,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547016576] [2019-12-26 20:52:08,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-26 20:52:08,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-26 20:52:08,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 20:52:08,996 INFO L87 Difference]: Start difference. First operand 88 states and 178 transitions. Second operand 37 states. [2019-12-26 20:52:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:09,982 INFO L93 Difference]: Finished difference Result 92 states and 186 transitions. [2019-12-26 20:52:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 20:52:09,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-26 20:52:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:09,983 INFO L225 Difference]: With dead ends: 92 [2019-12-26 20:52:09,984 INFO L226 Difference]: Without dead ends: 89 [2019-12-26 20:52:09,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1514, Invalid=3178, Unknown=0, NotChecked=0, Total=4692 [2019-12-26 20:52:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-26 20:52:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-12-26 20:52:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-26 20:52:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-26 20:52:09,987 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 40 [2019-12-26 20:52:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:09,988 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-26 20:52:09,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-26 20:52:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-26 20:52:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 20:52:09,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:09,988 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:10,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:10,192 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1228425103, now seen corresponding path program 64 times [2019-12-26 20:52:10,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:10,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478396205] [2019-12-26 20:52:10,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:10,590 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-26 20:52:10,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478396205] [2019-12-26 20:52:10,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065516874] [2019-12-26 20:52:10,590 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-26 20:52:10,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:52:10,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:10,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-26 20:52:10,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:10,674 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-26 20:52:10,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:10,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-26 20:52:10,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869884880] [2019-12-26 20:52:10,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-26 20:52:10,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-26 20:52:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 20:52:10,677 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 37 states. [2019-12-26 20:52:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:11,640 INFO L93 Difference]: Finished difference Result 93 states and 188 transitions. [2019-12-26 20:52:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 20:52:11,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-26 20:52:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:11,642 INFO L225 Difference]: With dead ends: 93 [2019-12-26 20:52:11,642 INFO L226 Difference]: Without dead ends: 90 [2019-12-26 20:52:11,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1550, Invalid=3280, Unknown=0, NotChecked=0, Total=4830 [2019-12-26 20:52:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-26 20:52:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-26 20:52:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-26 20:52:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-12-26 20:52:11,646 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 40 [2019-12-26 20:52:11,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:11,646 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-12-26 20:52:11,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-26 20:52:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-12-26 20:52:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 20:52:11,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:11,647 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:11,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:11,850 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1911904150, now seen corresponding path program 65 times [2019-12-26 20:52:11,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:11,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920082599] [2019-12-26 20:52:11,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:12,258 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-26 20:52:12,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920082599] [2019-12-26 20:52:12,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676360404] [2019-12-26 20:52:12,259 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-26 20:52:12,332 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-26 20:52:12,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:12,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-26 20:52:12,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:12,381 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-26 20:52:12,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:12,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-26 20:52:12,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794574342] [2019-12-26 20:52:12,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-26 20:52:12,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:12,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-26 20:52:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 20:52:12,383 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 38 states. [2019-12-26 20:52:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:13,470 INFO L93 Difference]: Finished difference Result 94 states and 190 transitions. [2019-12-26 20:52:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 20:52:13,470 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-26 20:52:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:13,471 INFO L225 Difference]: With dead ends: 94 [2019-12-26 20:52:13,471 INFO L226 Difference]: Without dead ends: 91 [2019-12-26 20:52:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1640, Invalid=3472, Unknown=0, NotChecked=0, Total=5112 [2019-12-26 20:52:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-26 20:52:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2019-12-26 20:52:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-26 20:52:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 108 transitions. [2019-12-26 20:52:13,475 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 108 transitions. Word has length 41 [2019-12-26 20:52:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:13,475 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 108 transitions. [2019-12-26 20:52:13,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-26 20:52:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 108 transitions. [2019-12-26 20:52:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 20:52:13,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:13,476 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:13,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:13,680 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash -573527414, now seen corresponding path program 66 times [2019-12-26 20:52:13,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:13,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713626016] [2019-12-26 20:52:13,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:14,099 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-26 20:52:14,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713626016] [2019-12-26 20:52:14,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490636384] [2019-12-26 20:52:14,100 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-26 20:52:14,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-26 20:52:14,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:14,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-26 20:52:14,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:14,204 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-26 20:52:14,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:14,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-26 20:52:14,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571453551] [2019-12-26 20:52:14,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-26 20:52:14,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-26 20:52:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 20:52:14,207 INFO L87 Difference]: Start difference. First operand 53 states and 108 transitions. Second operand 38 states. [2019-12-26 20:52:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:15,243 INFO L93 Difference]: Finished difference Result 95 states and 192 transitions. [2019-12-26 20:52:15,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 20:52:15,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-26 20:52:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:15,245 INFO L225 Difference]: With dead ends: 95 [2019-12-26 20:52:15,245 INFO L226 Difference]: Without dead ends: 92 [2019-12-26 20:52:15,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1671, Invalid=3441, Unknown=0, NotChecked=0, Total=5112 [2019-12-26 20:52:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-26 20:52:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-26 20:52:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-26 20:52:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 186 transitions. [2019-12-26 20:52:15,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 186 transitions. Word has length 41 [2019-12-26 20:52:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:15,249 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 186 transitions. [2019-12-26 20:52:15,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-26 20:52:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 186 transitions. [2019-12-26 20:52:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 20:52:15,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:15,250 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:15,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:15,454 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash -860513437, now seen corresponding path program 67 times [2019-12-26 20:52:15,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:15,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082490882] [2019-12-26 20:52:15,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:15,922 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-26 20:52:15,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082490882] [2019-12-26 20:52:15,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712653357] [2019-12-26 20:52:15,923 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-26 20:52:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:15,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-26 20:52:15,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:16,031 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-26 20:52:16,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:16,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-26 20:52:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935541982] [2019-12-26 20:52:16,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-26 20:52:16,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-26 20:52:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 20:52:16,033 INFO L87 Difference]: Start difference. First operand 92 states and 186 transitions. Second operand 39 states. [2019-12-26 20:52:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:17,117 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2019-12-26 20:52:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 20:52:17,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-26 20:52:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:17,118 INFO L225 Difference]: With dead ends: 96 [2019-12-26 20:52:17,119 INFO L226 Difference]: Without dead ends: 93 [2019-12-26 20:52:17,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1693, Invalid=3563, Unknown=0, NotChecked=0, Total=5256 [2019-12-26 20:52:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-26 20:52:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-12-26 20:52:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-26 20:52:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-26 20:52:17,122 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 42 [2019-12-26 20:52:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:17,122 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-26 20:52:17,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-26 20:52:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-26 20:52:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 20:52:17,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:17,123 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:17,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:17,324 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -599480345, now seen corresponding path program 68 times [2019-12-26 20:52:17,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:17,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8126364] [2019-12-26 20:52:17,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:17,761 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-26 20:52:17,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8126364] [2019-12-26 20:52:17,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110258377] [2019-12-26 20:52:17,761 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-26 20:52:17,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:52:17,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:17,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-26 20:52:17,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:17,848 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-26 20:52:17,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:17,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-26 20:52:17,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149320106] [2019-12-26 20:52:17,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-26 20:52:17,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-26 20:52:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 20:52:17,850 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 39 states. [2019-12-26 20:52:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:18,923 INFO L93 Difference]: Finished difference Result 97 states and 196 transitions. [2019-12-26 20:52:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 20:52:18,924 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-26 20:52:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:18,925 INFO L225 Difference]: With dead ends: 97 [2019-12-26 20:52:18,925 INFO L226 Difference]: Without dead ends: 94 [2019-12-26 20:52:18,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1731, Invalid=3671, Unknown=0, NotChecked=0, Total=5402 [2019-12-26 20:52:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-26 20:52:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-26 20:52:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-26 20:52:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 190 transitions. [2019-12-26 20:52:18,928 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 190 transitions. Word has length 42 [2019-12-26 20:52:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:18,928 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 190 transitions. [2019-12-26 20:52:18,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-26 20:52:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 190 transitions. [2019-12-26 20:52:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 20:52:18,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:18,929 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:19,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:19,130 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash -906112466, now seen corresponding path program 69 times [2019-12-26 20:52:19,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:19,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848984408] [2019-12-26 20:52:19,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:19,586 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-26 20:52:19,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848984408] [2019-12-26 20:52:19,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037762288] [2019-12-26 20:52:19,587 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-26 20:52:19,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-26 20:52:19,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:19,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-26 20:52:19,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:19,707 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-26 20:52:19,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:19,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-26 20:52:19,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037477544] [2019-12-26 20:52:19,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-26 20:52:19,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-26 20:52:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 20:52:19,708 INFO L87 Difference]: Start difference. First operand 94 states and 190 transitions. Second operand 40 states. [2019-12-26 20:52:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:20,888 INFO L93 Difference]: Finished difference Result 98 states and 198 transitions. [2019-12-26 20:52:20,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 20:52:20,889 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-26 20:52:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:20,890 INFO L225 Difference]: With dead ends: 98 [2019-12-26 20:52:20,890 INFO L226 Difference]: Without dead ends: 95 [2019-12-26 20:52:20,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1826, Invalid=3874, Unknown=0, NotChecked=0, Total=5700 [2019-12-26 20:52:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-26 20:52:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2019-12-26 20:52:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-26 20:52:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 112 transitions. [2019-12-26 20:52:20,893 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 112 transitions. Word has length 43 [2019-12-26 20:52:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:20,893 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 112 transitions. [2019-12-26 20:52:20,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-26 20:52:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 112 transitions. [2019-12-26 20:52:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 20:52:20,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:20,894 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:21,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:21,098 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1404021454, now seen corresponding path program 70 times [2019-12-26 20:52:21,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:21,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240551453] [2019-12-26 20:52:21,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:21,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-26 20:52:21,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240551453] [2019-12-26 20:52:21,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318743912] [2019-12-26 20:52:21,573 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-26 20:52:21,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:52:21,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:21,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-26 20:52:21,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:21,689 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-26 20:52:21,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:21,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-26 20:52:21,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389548774] [2019-12-26 20:52:21,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-26 20:52:21,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-26 20:52:21,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 20:52:21,690 INFO L87 Difference]: Start difference. First operand 55 states and 112 transitions. Second operand 40 states. [2019-12-26 20:52:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:22,824 INFO L93 Difference]: Finished difference Result 99 states and 200 transitions. [2019-12-26 20:52:22,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 20:52:22,824 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-26 20:52:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:22,825 INFO L225 Difference]: With dead ends: 99 [2019-12-26 20:52:22,825 INFO L226 Difference]: Without dead ends: 96 [2019-12-26 20:52:22,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1859, Invalid=3841, Unknown=0, NotChecked=0, Total=5700 [2019-12-26 20:52:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-26 20:52:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-26 20:52:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-26 20:52:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 194 transitions. [2019-12-26 20:52:22,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 194 transitions. Word has length 43 [2019-12-26 20:52:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:22,829 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 194 transitions. [2019-12-26 20:52:22,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-26 20:52:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 194 transitions. [2019-12-26 20:52:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 20:52:22,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:22,830 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:23,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:23,033 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1975284683, now seen corresponding path program 71 times [2019-12-26 20:52:23,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:23,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740988652] [2019-12-26 20:52:23,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:23,504 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-26 20:52:23,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740988652] [2019-12-26 20:52:23,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863491937] [2019-12-26 20:52:23,504 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-26 20:52:23,582 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-26 20:52:23,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:23,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-26 20:52:23,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:23,611 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-26 20:52:23,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:23,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-26 20:52:23,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843411306] [2019-12-26 20:52:23,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-26 20:52:23,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-26 20:52:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 20:52:23,613 INFO L87 Difference]: Start difference. First operand 96 states and 194 transitions. Second operand 41 states. [2019-12-26 20:52:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:24,812 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2019-12-26 20:52:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 20:52:24,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-26 20:52:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:24,814 INFO L225 Difference]: With dead ends: 100 [2019-12-26 20:52:24,814 INFO L226 Difference]: Without dead ends: 97 [2019-12-26 20:52:24,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1882, Invalid=3970, Unknown=0, NotChecked=0, Total=5852 [2019-12-26 20:52:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-26 20:52:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2019-12-26 20:52:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-26 20:52:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-26 20:52:24,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 44 [2019-12-26 20:52:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:24,818 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-26 20:52:24,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-26 20:52:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-26 20:52:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 20:52:24,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:24,819 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:25,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:25,023 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:25,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash -574991809, now seen corresponding path program 72 times [2019-12-26 20:52:25,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:25,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897909390] [2019-12-26 20:52:25,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:25,489 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-26 20:52:25,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897909390] [2019-12-26 20:52:25,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35642872] [2019-12-26 20:52:25,490 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-26 20:52:25,571 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-26 20:52:25,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:25,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-26 20:52:25,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:25,631 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-26 20:52:25,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:25,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-26 20:52:25,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385637717] [2019-12-26 20:52:25,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-26 20:52:25,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-26 20:52:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 20:52:25,632 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 41 states. [2019-12-26 20:52:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:26,813 INFO L93 Difference]: Finished difference Result 101 states and 204 transitions. [2019-12-26 20:52:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 20:52:26,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-26 20:52:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:26,814 INFO L225 Difference]: With dead ends: 101 [2019-12-26 20:52:26,815 INFO L226 Difference]: Without dead ends: 98 [2019-12-26 20:52:26,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1922, Invalid=4084, Unknown=0, NotChecked=0, Total=6006 [2019-12-26 20:52:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-26 20:52:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-26 20:52:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-26 20:52:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2019-12-26 20:52:26,818 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 198 transitions. Word has length 44 [2019-12-26 20:52:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:26,819 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 198 transitions. [2019-12-26 20:52:26,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-26 20:52:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 198 transitions. [2019-12-26 20:52:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 20:52:26,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:26,819 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:27,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:27,022 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1104283334, now seen corresponding path program 73 times [2019-12-26 20:52:27,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056534715] [2019-12-26 20:52:27,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:27,517 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-26 20:52:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056534715] [2019-12-26 20:52:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104314898] [2019-12-26 20:52:27,518 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-26 20:52:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:27,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-26 20:52:27,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:27,617 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-26 20:52:27,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:27,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-26 20:52:27,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671083795] [2019-12-26 20:52:27,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-26 20:52:27,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-26 20:52:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 20:52:27,620 INFO L87 Difference]: Start difference. First operand 98 states and 198 transitions. Second operand 42 states. [2019-12-26 20:52:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:28,908 INFO L93 Difference]: Finished difference Result 102 states and 206 transitions. [2019-12-26 20:52:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 20:52:28,908 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-26 20:52:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:28,909 INFO L225 Difference]: With dead ends: 102 [2019-12-26 20:52:28,909 INFO L226 Difference]: Without dead ends: 99 [2019-12-26 20:52:28,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2022, Invalid=4298, Unknown=0, NotChecked=0, Total=6320 [2019-12-26 20:52:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-26 20:52:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-12-26 20:52:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-26 20:52:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 116 transitions. [2019-12-26 20:52:28,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 116 transitions. Word has length 45 [2019-12-26 20:52:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:28,912 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 116 transitions. [2019-12-26 20:52:28,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-26 20:52:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 116 transitions. [2019-12-26 20:52:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 20:52:28,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:28,913 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:29,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:29,115 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -644876838, now seen corresponding path program 74 times [2019-12-26 20:52:29,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:29,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878631741] [2019-12-26 20:52:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:29,625 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-26 20:52:29,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878631741] [2019-12-26 20:52:29,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540771305] [2019-12-26 20:52:29,626 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-26 20:52:29,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:52:29,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:29,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-26 20:52:29,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:29,760 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-26 20:52:29,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:29,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-26 20:52:29,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294292170] [2019-12-26 20:52:29,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-26 20:52:29,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-26 20:52:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 20:52:29,762 INFO L87 Difference]: Start difference. First operand 57 states and 116 transitions. Second operand 42 states. [2019-12-26 20:52:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:31,014 INFO L93 Difference]: Finished difference Result 103 states and 208 transitions. [2019-12-26 20:52:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 20:52:31,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-26 20:52:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:31,016 INFO L225 Difference]: With dead ends: 103 [2019-12-26 20:52:31,016 INFO L226 Difference]: Without dead ends: 100 [2019-12-26 20:52:31,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2057, Invalid=4263, Unknown=0, NotChecked=0, Total=6320 [2019-12-26 20:52:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-26 20:52:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-26 20:52:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-26 20:52:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 202 transitions. [2019-12-26 20:52:31,020 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 202 transitions. Word has length 45 [2019-12-26 20:52:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:31,020 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 202 transitions. [2019-12-26 20:52:31,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-26 20:52:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 202 transitions. [2019-12-26 20:52:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 20:52:31,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:31,020 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:31,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:31,221 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash -126954957, now seen corresponding path program 75 times [2019-12-26 20:52:31,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:31,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042581450] [2019-12-26 20:52:31,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:31,761 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-26 20:52:31,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042581450] [2019-12-26 20:52:31,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839178158] [2019-12-26 20:52:31,762 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-26 20:52:31,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-26 20:52:31,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:31,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-26 20:52:31,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:31,875 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-26 20:52:31,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:31,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-26 20:52:31,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548493222] [2019-12-26 20:52:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-26 20:52:31,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-26 20:52:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 20:52:31,876 INFO L87 Difference]: Start difference. First operand 100 states and 202 transitions. Second operand 43 states. [2019-12-26 20:52:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:33,094 INFO L93 Difference]: Finished difference Result 104 states and 210 transitions. [2019-12-26 20:52:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 20:52:33,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-26 20:52:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:33,096 INFO L225 Difference]: With dead ends: 104 [2019-12-26 20:52:33,096 INFO L226 Difference]: Without dead ends: 101 [2019-12-26 20:52:33,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=4689, Unknown=0, NotChecked=0, Total=6642 [2019-12-26 20:52:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-26 20:52:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-12-26 20:52:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-26 20:52:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-26 20:52:33,098 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 46 [2019-12-26 20:52:33,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:33,098 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-26 20:52:33,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-26 20:52:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-26 20:52:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 20:52:33,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:33,099 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:33,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:33,303 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1483654807, now seen corresponding path program 76 times [2019-12-26 20:52:33,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:33,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618870047] [2019-12-26 20:52:33,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:33,819 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-26 20:52:33,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618870047] [2019-12-26 20:52:33,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514824884] [2019-12-26 20:52:33,820 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-26 20:52:33,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:52:33,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:33,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-26 20:52:33,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:33,925 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-26 20:52:33,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:33,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-26 20:52:33,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524498817] [2019-12-26 20:52:33,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-26 20:52:33,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:33,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-26 20:52:33,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 20:52:33,927 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 43 states. [2019-12-26 20:52:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:35,225 INFO L93 Difference]: Finished difference Result 105 states and 212 transitions. [2019-12-26 20:52:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 20:52:35,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-26 20:52:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:35,229 INFO L225 Difference]: With dead ends: 105 [2019-12-26 20:52:35,230 INFO L226 Difference]: Without dead ends: 102 [2019-12-26 20:52:35,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2123, Invalid=4519, Unknown=0, NotChecked=0, Total=6642 [2019-12-26 20:52:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-26 20:52:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-26 20:52:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-26 20:52:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 206 transitions. [2019-12-26 20:52:35,233 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 206 transitions. Word has length 46 [2019-12-26 20:52:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:35,233 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 206 transitions. [2019-12-26 20:52:35,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-26 20:52:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2019-12-26 20:52:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 20:52:35,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:35,234 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:35,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:35,437 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash 359363934, now seen corresponding path program 77 times [2019-12-26 20:52:35,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:35,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100579851] [2019-12-26 20:52:35,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:52:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:52:35,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:52:35,511 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:52:35,515 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-26 20:52:35,516 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-26 20:52:35,516 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-26 20:52:35,516 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-26 20:52:35,517 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-26 20:52:35,517 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-26 20:52:35,517 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-26 20:52:35,517 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-26 20:52:35,517 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-26 20:52:35,517 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-26 20:52:35,518 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-26 20:52:35,518 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-26 20:52:35,518 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-26 20:52:35,518 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-26 20:52:35,518 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-26 20:52:35,519 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-26 20:52:35,519 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-26 20:52:35,519 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-26 20:52:35,519 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-26 20:52:35,519 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-26 20:52:35,519 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-26 20:52:35,520 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-26 20:52:35,520 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-26 20:52:35,520 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-26 20:52:35,520 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-26 20:52:35,520 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-26 20:52:35,520 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-26 20:52:35,521 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-26 20:52:35,521 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-26 20:52:35,521 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-26 20:52:35,521 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-26 20:52:35,521 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-26 20:52:35,522 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-26 20:52:35,522 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-26 20:52:35,522 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-26 20:52:35,522 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-26 20:52:35,522 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-26 20:52:35,522 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-26 20:52:35,523 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-26 20:52:35,523 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-26 20:52:35,523 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-26 20:52:35,523 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-26 20:52:35,523 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-26 20:52:35,523 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-26 20:52:35,524 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-26 20:52:35,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 08:52:35 BasicIcfg [2019-12-26 20:52:35,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 20:52:35,545 INFO L168 Benchmark]: Toolchain (without parser) took 90638.42 ms. Allocated memory was 136.8 MB in the beginning and 524.3 MB in the end (delta: 387.4 MB). Free memory was 100.4 MB in the beginning and 387.5 MB in the end (delta: -287.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,546 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.89 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 161.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 201.9 MB. Free memory was 161.1 MB in the beginning and 159.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,547 INFO L168 Benchmark]: Boogie Preprocessor took 25.85 ms. Allocated memory is still 201.9 MB. Free memory was 159.0 MB in the beginning and 157.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,547 INFO L168 Benchmark]: RCFGBuilder took 401.26 ms. Allocated memory is still 201.9 MB. Free memory was 157.7 MB in the beginning and 138.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,548 INFO L168 Benchmark]: TraceAbstraction took 89440.16 ms. Allocated memory was 201.9 MB in the beginning and 524.3 MB in the end (delta: 322.4 MB). Free memory was 137.8 MB in the beginning and 387.5 MB in the end (delta: -249.7 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. [2019-12-26 20:52:35,550 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.89 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 161.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.98 ms. Allocated memory is still 201.9 MB. Free memory was 161.1 MB in the beginning and 159.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.85 ms. Allocated memory is still 201.9 MB. Free memory was 159.0 MB in the beginning and 157.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.26 ms. Allocated memory is still 201.9 MB. Free memory was 157.7 MB in the beginning and 138.5 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89440.16 ms. Allocated memory was 201.9 MB in the beginning and 524.3 MB in the end (delta: 322.4 MB). Free memory was 137.8 MB in the beginning and 387.5 MB in the end (delta: -249.7 MB). Peak memory consumption was 72.7 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: 89.2s, OverallIterations: 79, TraceHistogramMax: 20, AutomataDifference: 45.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 899 SDtfs, 2769 SDslu, 3466 SDs, 0 SdLazy, 5216 SolverSat, 6109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5176 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 3252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32614 ImplicationChecksByTransitivity, 54.0s 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.2s 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...