/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:21:25,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:21:25,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:21:25,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:21:25,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:21:25,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:21:25,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:21:25,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:21:25,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:21:25,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:21:25,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:21:25,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:21:25,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:21:25,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:21:25,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:21:25,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:21:25,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:21:25,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:21:25,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:21:25,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:21:25,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:21:25,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:21:25,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:21:25,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:21:25,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:21:25,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:21:25,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:21:25,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:21:25,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:21:25,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:21:25,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:21:25,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:21:25,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:21:25,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:21:25,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:21:25,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:21:25,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:21:25,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:21:25,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:21:25,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:21:25,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:21:25,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:21:25,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:21:25,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:21:25,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:21:25,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:21:25,309 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:21:25,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:21:25,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:21:25,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:21:25,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:21:25,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:21:25,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:21:25,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:21:25,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:21:25,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:21:25,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:21:25,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:21:25,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:21:25,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:21:25,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:21:25,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:21:25,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:21:25,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:21:25,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:21:25,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:21:25,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:21:25,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:21:25,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:21:25,315 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:21:25,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:21:25,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:21:25,316 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:21:25,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:21:25,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:21:25,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:21:25,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:21:25,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:21:25,609 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:21:25,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 19:21:25,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c2368bc/58c1f7b37f2b43c0881665f008289054/FLAG761a8122c [2019-12-27 19:21:26,251 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:21:26,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 19:21:26,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c2368bc/58c1f7b37f2b43c0881665f008289054/FLAG761a8122c [2019-12-27 19:21:26,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c2368bc/58c1f7b37f2b43c0881665f008289054 [2019-12-27 19:21:26,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:21:26,544 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:21:26,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:26,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:21:26,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:21:26,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:26" (1/1) ... [2019-12-27 19:21:26,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f2dc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:26, skipping insertion in model container [2019-12-27 19:21:26,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:26" (1/1) ... [2019-12-27 19:21:26,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:21:26,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:21:27,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:27,082 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:21:27,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:27,203 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:21:27,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27 WrapperNode [2019-12-27 19:21:27,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:27,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:27,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:21:27,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:21:27,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:27,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:21:27,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:21:27,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:21:27,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... [2019-12-27 19:21:27,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:21:27,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:21:27,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:21:27,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:21:27,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 19:21:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 19:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 19:21:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 19:21:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:21:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:21:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:21:27,350 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:21:27,688 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:21:27,688 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 19:21:27,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:27 BoogieIcfgContainer [2019-12-27 19:21:27,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:21:27,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:21:27,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:21:27,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:21:27,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:21:26" (1/3) ... [2019-12-27 19:21:27,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7838029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:27, skipping insertion in model container [2019-12-27 19:21:27,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:27" (2/3) ... [2019-12-27 19:21:27,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7838029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:27, skipping insertion in model container [2019-12-27 19:21:27,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:27" (3/3) ... [2019-12-27 19:21:27,698 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2019-12-27 19:21:27,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:21:27,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:21:27,712 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:21:27,713 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:21:27,741 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,741 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,741 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,742 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,742 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,743 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,743 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,743 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,744 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,744 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,744 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,745 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,746 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,746 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,746 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,747 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,747 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,747 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,747 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,749 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,749 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,750 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,750 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,750 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,754 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,755 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,755 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,755 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,755 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,756 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,761 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,761 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,762 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,762 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,763 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:27,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 19:21:27,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:21:27,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:21:27,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:21:27,807 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:21:27,807 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:21:27,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:21:27,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:21:27,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:21:27,824 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-27 19:21:27,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 19:21:27,875 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 19:21:27,876 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:21:27,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 19:21:27,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-27 19:21:27,902 INFO L132 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-27 19:21:27,903 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:21:27,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 0/43 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-27 19:21:27,906 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-27 19:21:27,908 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:21:28,987 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 19:21:29,105 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-27 19:21:29,105 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-27 19:21:29,110 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-27 19:21:29,120 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-27 19:21:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-27 19:21:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:21:29,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:21:29,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-27 19:21:29,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416378076] [2019-12-27 19:21:29,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:29,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416378076] [2019-12-27 19:21:29,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:21:29,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888410429] [2019-12-27 19:21:29,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:21:29,457 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:29,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:29,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:29,482 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-27 19:21:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:29,515 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-27 19:21:29,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:29,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 19:21:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:29,528 INFO L225 Difference]: With dead ends: 48 [2019-12-27 19:21:29,528 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 19:21:29,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:29,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 19:21:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 19:21:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 19:21:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-27 19:21:29,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-27 19:21:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:29,564 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-27 19:21:29,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-27 19:21:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:21:29,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:29,566 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-27 19:21:29,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711196160] [2019-12-27 19:21:29,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:29,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711196160] [2019-12-27 19:21:29,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:21:29,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [496183981] [2019-12-27 19:21:29,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 15 transitions. [2019-12-27 19:21:29,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:29,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:21:29,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:21:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:21:29,665 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-27 19:21:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:29,703 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 19:21:29,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:29,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 19:21:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:29,705 INFO L225 Difference]: With dead ends: 34 [2019-12-27 19:21:29,705 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 19:21:29,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:21:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 19:21:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 19:21:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 19:21:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 19:21:29,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-27 19:21:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:29,713 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 19:21:29,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:21:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 19:21:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:21:29,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:29,715 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-27 19:21:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878336509] [2019-12-27 19:21:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:29,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878336509] [2019-12-27 19:21:29,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:29,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701224296] [2019-12-27 19:21:29,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 21 transitions. [2019-12-27 19:21:29,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,801 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:29,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:21:29,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:21:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:21:29,803 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-27 19:21:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:29,851 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 19:21:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:21:29,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:21:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:29,854 INFO L225 Difference]: With dead ends: 34 [2019-12-27 19:21:29,855 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 19:21:29,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:21:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 19:21:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-27 19:21:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 19:21:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 19:21:29,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-27 19:21:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:29,863 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 19:21:29,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:21:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 19:21:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:21:29,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:29,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:29,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-27 19:21:29,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:29,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342828005] [2019-12-27 19:21:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:29,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342828005] [2019-12-27 19:21:29,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:29,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:29,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615718039] [2019-12-27 19:21:29,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:29,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:29,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 17 transitions. [2019-12-27 19:21:29,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:29,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:29,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:21:29,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:21:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:21:29,962 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-27 19:21:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:30,006 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 19:21:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:30,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:21:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:30,007 INFO L225 Difference]: With dead ends: 32 [2019-12-27 19:21:30,007 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 19:21:30,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:21:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 19:21:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 19:21:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 19:21:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 19:21:30,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-27 19:21:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:30,022 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 19:21:30,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:21:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 19:21:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:21:30,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:30,023 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:30,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-27 19:21:30,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:30,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017467323] [2019-12-27 19:21:30,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:30,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017467323] [2019-12-27 19:21:30,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422999007] [2019-12-27 19:21:30,117 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:30,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:21:30,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:30,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:21:30,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:30,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:30,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 19:21:30,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914092001] [2019-12-27 19:21:30,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:30,228 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:30,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 22 transitions. [2019-12-27 19:21:30,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:30,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:30,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:21:30,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:30,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:21:30,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:30,233 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 6 states. [2019-12-27 19:21:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:30,290 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-27 19:21:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:30,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 19:21:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:30,292 INFO L225 Difference]: With dead ends: 32 [2019-12-27 19:21:30,292 INFO L226 Difference]: Without dead ends: 29 [2019-12-27 19:21:30,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-27 19:21:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-27 19:21:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-27 19:21:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-27 19:21:30,297 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-27 19:21:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:30,297 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-27 19:21:30,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:21:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-27 19:21:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:21:30,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:30,298 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:30,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:30,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-27 19:21:30,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:30,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485797483] [2019-12-27 19:21:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:30,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485797483] [2019-12-27 19:21:30,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205369428] [2019-12-27 19:21:30,568 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:30,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:30,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:30,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:21:30,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:30,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:30,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 19:21:30,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296120426] [2019-12-27 19:21:30,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:30,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:30,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 18 transitions. [2019-12-27 19:21:30,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:30,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:30,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:21:30,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:21:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:30,654 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 6 states. [2019-12-27 19:21:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:30,737 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-27 19:21:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:21:30,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-27 19:21:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:30,738 INFO L225 Difference]: With dead ends: 33 [2019-12-27 19:21:30,738 INFO L226 Difference]: Without dead ends: 30 [2019-12-27 19:21:30,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-27 19:21:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-27 19:21:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 19:21:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 19:21:30,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-27 19:21:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:30,743 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 19:21:30,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:21:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 19:21:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:21:30,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:30,744 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:30,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:30,948 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-27 19:21:30,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:30,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313111261] [2019-12-27 19:21:30,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313111261] [2019-12-27 19:21:31,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081480090] [2019-12-27 19:21:31,003 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:31,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:31,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:31,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 19:21:31,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:31,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:31,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 19:21:31,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800514356] [2019-12-27 19:21:31,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:31,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:31,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 23 transitions. [2019-12-27 19:21:31,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:31,092 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:31,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:31,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:31,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:31,095 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 7 states. [2019-12-27 19:21:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:31,165 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-27 19:21:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:21:31,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 19:21:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:31,166 INFO L225 Difference]: With dead ends: 34 [2019-12-27 19:21:31,166 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 19:21:31,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 19:21:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-27 19:21:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 19:21:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-27 19:21:31,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-27 19:21:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:31,175 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-27 19:21:31,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-27 19:21:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:21:31,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:31,176 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:31,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:31,377 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-27 19:21:31,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:31,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443401088] [2019-12-27 19:21:31,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:31,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443401088] [2019-12-27 19:21:31,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29746067] [2019-12-27 19:21:31,467 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:31,521 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 19:21:31,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:31,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 19:21:31,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:31,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:31,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 19:21:31,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086608099] [2019-12-27 19:21:31,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:31,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:31,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 19 transitions. [2019-12-27 19:21:31,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:31,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:31,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:21:31,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:31,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:21:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:21:31,548 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 7 states. [2019-12-27 19:21:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:31,629 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-27 19:21:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:31,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-27 19:21:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:31,630 INFO L225 Difference]: With dead ends: 35 [2019-12-27 19:21:31,630 INFO L226 Difference]: Without dead ends: 32 [2019-12-27 19:21:31,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-27 19:21:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-27 19:21:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 19:21:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 19:21:31,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-27 19:21:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 19:21:31,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:21:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 19:21:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:21:31,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:31,637 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:31,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:31,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-27 19:21:31,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:31,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488557768] [2019-12-27 19:21:31,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:31,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488557768] [2019-12-27 19:21:31,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155970288] [2019-12-27 19:21:31,936 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:32,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:21:32,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:32,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:32,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 19:21:32,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538993146] [2019-12-27 19:21:32,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:32,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:32,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 24 transitions. [2019-12-27 19:21:32,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:32,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:32,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:32,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:32,051 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 8 states. [2019-12-27 19:21:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:32,162 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-27 19:21:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:32,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 19:21:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:32,163 INFO L225 Difference]: With dead ends: 36 [2019-12-27 19:21:32,163 INFO L226 Difference]: Without dead ends: 33 [2019-12-27 19:21:32,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-27 19:21:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-27 19:21:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 19:21:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-27 19:21:32,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-27 19:21:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-27 19:21:32,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-27 19:21:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:21:32,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:32,174 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:32,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:32,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-27 19:21:32,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:32,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593198158] [2019-12-27 19:21:32,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:32,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593198158] [2019-12-27 19:21:32,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014759289] [2019-12-27 19:21:32,428 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:32,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:32,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:32,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 19:21:32,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:32,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:32,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 19:21:32,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057749046] [2019-12-27 19:21:32,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:32,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:32,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 20 transitions. [2019-12-27 19:21:32,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:32,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:32,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:21:32,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:21:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:21:32,507 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 8 states. [2019-12-27 19:21:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:32,630 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-27 19:21:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:32,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-27 19:21:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:32,631 INFO L225 Difference]: With dead ends: 37 [2019-12-27 19:21:32,631 INFO L226 Difference]: Without dead ends: 34 [2019-12-27 19:21:32,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-27 19:21:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-27 19:21:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 19:21:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 19:21:32,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-27 19:21:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:32,636 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 19:21:32,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:21:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 19:21:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:21:32,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:32,637 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:32,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:32,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-27 19:21:32,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:32,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147349844] [2019-12-27 19:21:32,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:32,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147349844] [2019-12-27 19:21:32,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289256749] [2019-12-27 19:21:32,923 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:32,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 19:21:32,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:32,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 19:21:32,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:33,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:33,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 19:21:33,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1767461465] [2019-12-27 19:21:33,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:33,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:33,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 25 transitions. [2019-12-27 19:21:33,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:33,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:33,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:33,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:33,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:33,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:33,043 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 9 states. [2019-12-27 19:21:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:33,164 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-27 19:21:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 19:21:33,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 19:21:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:33,166 INFO L225 Difference]: With dead ends: 38 [2019-12-27 19:21:33,166 INFO L226 Difference]: Without dead ends: 35 [2019-12-27 19:21:33,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-27 19:21:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-27 19:21:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-27 19:21:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-27 19:21:33,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-27 19:21:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:33,175 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-27 19:21:33,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-27 19:21:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:21:33,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:33,175 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:33,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:33,384 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-27 19:21:33,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:33,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270067534] [2019-12-27 19:21:33,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:33,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270067534] [2019-12-27 19:21:33,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062665919] [2019-12-27 19:21:33,448 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:33,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:33,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:33,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 19:21:33,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:33,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:33,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 19:21:33,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009442670] [2019-12-27 19:21:33,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:33,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:33,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 21 transitions. [2019-12-27 19:21:33,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:33,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:33,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:21:33,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:21:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:21:33,525 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 9 states. [2019-12-27 19:21:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:33,638 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-27 19:21:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:33,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-27 19:21:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:33,640 INFO L225 Difference]: With dead ends: 39 [2019-12-27 19:21:33,640 INFO L226 Difference]: Without dead ends: 36 [2019-12-27 19:21:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:21:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-27 19:21:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-27 19:21:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 19:21:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 19:21:33,644 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-27 19:21:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:33,645 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 19:21:33,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:21:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 19:21:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:21:33,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:33,646 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:33,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:33,855 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:33,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-27 19:21:33,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:33,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357361037] [2019-12-27 19:21:33,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:33,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357361037] [2019-12-27 19:21:33,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097191267] [2019-12-27 19:21:33,938 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:33,988 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 19:21:33,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:33,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 19:21:33,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:34,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:34,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 19:21:34,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080495500] [2019-12-27 19:21:34,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:34,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:34,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 26 transitions. [2019-12-27 19:21:34,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:34,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:34,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:34,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:34,024 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 10 states. [2019-12-27 19:21:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:34,173 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-27 19:21:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:21:34,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 19:21:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:34,174 INFO L225 Difference]: With dead ends: 40 [2019-12-27 19:21:34,174 INFO L226 Difference]: Without dead ends: 37 [2019-12-27 19:21:34,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:21:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-27 19:21:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-27 19:21:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-27 19:21:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-27 19:21:34,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-27 19:21:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:34,185 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-27 19:21:34,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-27 19:21:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:21:34,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:34,189 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:34,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:34,393 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-27 19:21:34,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:34,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590349968] [2019-12-27 19:21:34,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:34,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590349968] [2019-12-27 19:21:34,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084342544] [2019-12-27 19:21:34,464 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:34,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 19:21:34,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:34,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 19:21:34,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:34,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:34,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 19:21:34,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517666714] [2019-12-27 19:21:34,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:34,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:34,554 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 19:21:34,554 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:34,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:34,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:21:34,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:21:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:21:34,556 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 10 states. [2019-12-27 19:21:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:34,696 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-27 19:21:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:34,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-27 19:21:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:34,697 INFO L225 Difference]: With dead ends: 41 [2019-12-27 19:21:34,697 INFO L226 Difference]: Without dead ends: 38 [2019-12-27 19:21:34,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-27 19:21:34,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-27 19:21:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 19:21:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 19:21:34,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-27 19:21:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:34,702 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 19:21:34,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:21:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 19:21:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:21:34,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:34,703 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:34,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:34,910 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-27 19:21:34,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:34,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809849227] [2019-12-27 19:21:34,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:35,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809849227] [2019-12-27 19:21:35,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332682198] [2019-12-27 19:21:35,010 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:35,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 19:21:35,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:35,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:35,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 19:21:35,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2040717741] [2019-12-27 19:21:35,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:35,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:35,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 27 transitions. [2019-12-27 19:21:35,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:35,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:35,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:35,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:35,115 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 11 states. [2019-12-27 19:21:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:35,272 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-27 19:21:35,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:21:35,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 19:21:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:35,273 INFO L225 Difference]: With dead ends: 42 [2019-12-27 19:21:35,273 INFO L226 Difference]: Without dead ends: 39 [2019-12-27 19:21:35,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-27 19:21:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-27 19:21:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-27 19:21:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-27 19:21:35,279 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-27 19:21:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:35,279 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-27 19:21:35,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-27 19:21:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:21:35,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:35,280 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:35,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:35,484 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-27 19:21:35,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:35,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458883834] [2019-12-27 19:21:35,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:35,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458883834] [2019-12-27 19:21:35,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567339664] [2019-12-27 19:21:35,570 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:35,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:35,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:35,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 19:21:35,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:35,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:35,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 19:21:35,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311809894] [2019-12-27 19:21:35,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:35,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:35,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 23 transitions. [2019-12-27 19:21:35,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:35,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:35,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:21:35,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:21:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:21:35,674 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 11 states. [2019-12-27 19:21:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:35,956 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-27 19:21:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:21:35,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-12-27 19:21:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:35,957 INFO L225 Difference]: With dead ends: 43 [2019-12-27 19:21:35,958 INFO L226 Difference]: Without dead ends: 40 [2019-12-27 19:21:35,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:21:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-27 19:21:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-27 19:21:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-27 19:21:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-27 19:21:35,962 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-27 19:21:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:35,962 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-27 19:21:35,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:21:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-27 19:21:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:21:35,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:35,963 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:36,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:36,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-27 19:21:36,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:36,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178953894] [2019-12-27 19:21:36,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:36,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178953894] [2019-12-27 19:21:36,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895335282] [2019-12-27 19:21:36,272 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:36,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 19:21:36,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:36,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 19:21:36,325 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:36,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:36,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 19:21:36,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1814105397] [2019-12-27 19:21:36,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:36,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:36,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 19:21:36,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:36,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:36,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:36,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:36,364 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 12 states. [2019-12-27 19:21:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:36,536 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-27 19:21:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:21:36,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 19:21:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:36,537 INFO L225 Difference]: With dead ends: 44 [2019-12-27 19:21:36,537 INFO L226 Difference]: Without dead ends: 41 [2019-12-27 19:21:36,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:21:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-27 19:21:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-27 19:21:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 19:21:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-27 19:21:36,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-27 19:21:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:36,541 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-27 19:21:36,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-27 19:21:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:21:36,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:36,542 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:36,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:36,749 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-27 19:21:36,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:36,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676523955] [2019-12-27 19:21:36,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:36,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676523955] [2019-12-27 19:21:36,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622941416] [2019-12-27 19:21:36,840 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:36,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:36,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:36,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 19:21:36,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:36,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:36,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 19:21:36,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191769385] [2019-12-27 19:21:36,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:36,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:36,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 24 transitions. [2019-12-27 19:21:36,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:36,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:36,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:21:36,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:21:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:21:36,918 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 12 states. [2019-12-27 19:21:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:37,095 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-27 19:21:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:21:37,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 19:21:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:37,096 INFO L225 Difference]: With dead ends: 45 [2019-12-27 19:21:37,097 INFO L226 Difference]: Without dead ends: 42 [2019-12-27 19:21:37,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:21:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-27 19:21:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-27 19:21:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-27 19:21:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-27 19:21:37,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-27 19:21:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-27 19:21:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:21:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-27 19:21:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:21:37,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:37,102 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:37,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:37,305 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-27 19:21:37,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:37,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008764228] [2019-12-27 19:21:37,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:37,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008764228] [2019-12-27 19:21:37,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949956258] [2019-12-27 19:21:37,418 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:37,481 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 19:21:37,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:37,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 19:21:37,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:37,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:37,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 19:21:37,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728111730] [2019-12-27 19:21:37,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:37,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:37,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 29 transitions. [2019-12-27 19:21:37,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:37,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:37,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:21:37,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:21:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:37,517 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 13 states. [2019-12-27 19:21:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:37,727 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-27 19:21:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:21:37,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-27 19:21:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:37,728 INFO L225 Difference]: With dead ends: 46 [2019-12-27 19:21:37,728 INFO L226 Difference]: Without dead ends: 43 [2019-12-27 19:21:37,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:21:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-27 19:21:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-27 19:21:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-27 19:21:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-27 19:21:37,732 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-27 19:21:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-27 19:21:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:21:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-27 19:21:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:21:37,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:37,733 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:37,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:37,936 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-27 19:21:37,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:37,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568878889] [2019-12-27 19:21:37,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:38,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568878889] [2019-12-27 19:21:38,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116639556] [2019-12-27 19:21:38,033 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:38,078 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 19:21:38,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:38,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 19:21:38,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:38,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:38,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 19:21:38,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591205831] [2019-12-27 19:21:38,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:38,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:38,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 25 transitions. [2019-12-27 19:21:38,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:38,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:38,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:21:38,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:21:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:21:38,109 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 13 states. [2019-12-27 19:21:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:38,323 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-27 19:21:38,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:21:38,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-12-27 19:21:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:38,324 INFO L225 Difference]: With dead ends: 47 [2019-12-27 19:21:38,325 INFO L226 Difference]: Without dead ends: 44 [2019-12-27 19:21:38,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:21:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-27 19:21:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-27 19:21:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-27 19:21:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-27 19:21:38,328 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-27 19:21:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:38,328 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-27 19:21:38,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:21:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-27 19:21:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:38,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:38,329 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:38,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:38,532 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-27 19:21:38,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:38,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758401362] [2019-12-27 19:21:38,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:38,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758401362] [2019-12-27 19:21:38,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569187618] [2019-12-27 19:21:38,626 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:38,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 19:21:38,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:38,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:38,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 19:21:38,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869314528] [2019-12-27 19:21:38,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:38,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:38,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 30 transitions. [2019-12-27 19:21:38,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:38,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:38,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 19:21:38,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 19:21:38,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:38,708 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 14 states. [2019-12-27 19:21:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:38,917 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-27 19:21:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:21:38,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-27 19:21:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:38,919 INFO L225 Difference]: With dead ends: 48 [2019-12-27 19:21:38,919 INFO L226 Difference]: Without dead ends: 45 [2019-12-27 19:21:38,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:21:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-27 19:21:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-27 19:21:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-27 19:21:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-27 19:21:38,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-27 19:21:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:38,923 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-27 19:21:38,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 19:21:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-27 19:21:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:21:38,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:38,924 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:39,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:39,128 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-27 19:21:39,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:39,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4254199] [2019-12-27 19:21:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:39,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4254199] [2019-12-27 19:21:39,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062138824] [2019-12-27 19:21:39,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:39,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:39,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:39,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 19:21:39,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:39,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:39,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 19:21:39,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1360736271] [2019-12-27 19:21:39,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:39,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:39,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 26 transitions. [2019-12-27 19:21:39,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:39,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:39,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 19:21:39,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 19:21:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:21:39,435 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 14 states. [2019-12-27 19:21:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:39,724 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-27 19:21:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:21:39,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-27 19:21:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:39,725 INFO L225 Difference]: With dead ends: 49 [2019-12-27 19:21:39,725 INFO L226 Difference]: Without dead ends: 46 [2019-12-27 19:21:39,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:21:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-27 19:21:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-27 19:21:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-27 19:21:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-27 19:21:39,732 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-27 19:21:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:39,732 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-27 19:21:39,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 19:21:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-27 19:21:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:39,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:39,733 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:39,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:39,934 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-27 19:21:39,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:39,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987221820] [2019-12-27 19:21:39,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987221820] [2019-12-27 19:21:40,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196074741] [2019-12-27 19:21:40,051 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:40,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 19:21:40,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:40,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 19:21:40,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:40,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:40,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 19:21:40,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418857668] [2019-12-27 19:21:40,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:40,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:40,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 19:21:40,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:40,152 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:21:40,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:21:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:21:40,154 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 15 states. [2019-12-27 19:21:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:40,383 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-27 19:21:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:21:40,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 19:21:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:40,384 INFO L225 Difference]: With dead ends: 50 [2019-12-27 19:21:40,384 INFO L226 Difference]: Without dead ends: 47 [2019-12-27 19:21:40,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:21:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-27 19:21:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-27 19:21:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 19:21:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-27 19:21:40,388 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-27 19:21:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:40,388 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-27 19:21:40,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:21:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-27 19:21:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:40,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:40,389 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:40,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:40,592 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-27 19:21:40,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:40,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317786224] [2019-12-27 19:21:40,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:40,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317786224] [2019-12-27 19:21:40,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124314054] [2019-12-27 19:21:40,707 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:40,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:40,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:40,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 19:21:40,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 19:21:40,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694417538] [2019-12-27 19:21:40,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:40,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:40,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 19:21:40,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:40,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:40,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:21:40,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:21:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:21:40,793 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 15 states. [2019-12-27 19:21:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:41,055 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-27 19:21:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:21:41,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-12-27 19:21:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:41,056 INFO L225 Difference]: With dead ends: 51 [2019-12-27 19:21:41,056 INFO L226 Difference]: Without dead ends: 48 [2019-12-27 19:21:41,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:21:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-27 19:21:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-27 19:21:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-27 19:21:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-27 19:21:41,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-27 19:21:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:41,061 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-27 19:21:41,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:21:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-27 19:21:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:41,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:41,062 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:41,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:41,265 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-27 19:21:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:41,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009928427] [2019-12-27 19:21:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:41,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009928427] [2019-12-27 19:21:41,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721398714] [2019-12-27 19:21:41,395 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:41,465 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 19:21:41,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:41,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 19:21:41,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:41,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:41,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 19:21:41,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [218944213] [2019-12-27 19:21:41,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:41,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:41,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 32 transitions. [2019-12-27 19:21:41,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:41,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:41,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:21:41,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:21:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:21:41,501 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 16 states. [2019-12-27 19:21:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:41,753 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-27 19:21:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:21:41,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-27 19:21:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:41,754 INFO L225 Difference]: With dead ends: 52 [2019-12-27 19:21:41,754 INFO L226 Difference]: Without dead ends: 49 [2019-12-27 19:21:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=550, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:21:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-27 19:21:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-27 19:21:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-27 19:21:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-27 19:21:41,757 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-27 19:21:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:41,757 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-27 19:21:41,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:21:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-27 19:21:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:21:41,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:41,758 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:41,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:41,962 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-27 19:21:41,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:41,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722082702] [2019-12-27 19:21:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:42,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722082702] [2019-12-27 19:21:42,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644324293] [2019-12-27 19:21:42,074 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:42,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 19:21:42,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:42,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 19:21:42,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:42,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:42,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 19:21:42,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553135375] [2019-12-27 19:21:42,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:42,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:42,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 28 transitions. [2019-12-27 19:21:42,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:42,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:42,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:21:42,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:21:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:21:42,164 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 16 states. [2019-12-27 19:21:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:42,438 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-27 19:21:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 19:21:42,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-27 19:21:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:42,439 INFO L225 Difference]: With dead ends: 53 [2019-12-27 19:21:42,440 INFO L226 Difference]: Without dead ends: 50 [2019-12-27 19:21:42,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2019-12-27 19:21:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-27 19:21:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-27 19:21:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-27 19:21:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-27 19:21:42,444 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-27 19:21:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:42,444 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-27 19:21:42,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:21:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-27 19:21:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:42,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:42,445 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:42,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:42,648 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-27 19:21:42,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:42,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99468336] [2019-12-27 19:21:42,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:42,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99468336] [2019-12-27 19:21:42,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982983697] [2019-12-27 19:21:42,764 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:42,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 19:21:42,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:42,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:42,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 19:21:42,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876418894] [2019-12-27 19:21:42,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:42,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:42,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 19:21:42,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:42,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:42,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:21:42,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:42,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:21:42,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:42,857 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 17 states. [2019-12-27 19:21:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:43,144 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-27 19:21:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 19:21:43,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 19:21:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:43,146 INFO L225 Difference]: With dead ends: 54 [2019-12-27 19:21:43,146 INFO L226 Difference]: Without dead ends: 51 [2019-12-27 19:21:43,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=631, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:21:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-27 19:21:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-27 19:21:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-27 19:21:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-27 19:21:43,151 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-27 19:21:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:43,151 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-27 19:21:43,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:21:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-27 19:21:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:21:43,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:43,152 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:43,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:43,356 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-27 19:21:43,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:43,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775160159] [2019-12-27 19:21:43,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:43,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775160159] [2019-12-27 19:21:43,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202696829] [2019-12-27 19:21:43,482 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:43,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:43,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:43,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 19:21:43,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:43,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:43,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 19:21:43,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700099492] [2019-12-27 19:21:43,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:43,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:43,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 19:21:43,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:43,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:43,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:21:43,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:21:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:21:43,570 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 17 states. [2019-12-27 19:21:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:43,847 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-27 19:21:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 19:21:43,848 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 19:21:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:43,848 INFO L225 Difference]: With dead ends: 55 [2019-12-27 19:21:43,849 INFO L226 Difference]: Without dead ends: 52 [2019-12-27 19:21:43,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:21:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-27 19:21:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-27 19:21:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-27 19:21:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-27 19:21:43,851 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-27 19:21:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:43,851 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-27 19:21:43,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:21:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-27 19:21:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:43,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:43,852 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:44,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:44,055 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-27 19:21:44,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:44,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869461189] [2019-12-27 19:21:44,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:44,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869461189] [2019-12-27 19:21:44,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425607900] [2019-12-27 19:21:44,203 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:44,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 19:21:44,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:44,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 19:21:44,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:44,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:44,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 19:21:44,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159469049] [2019-12-27 19:21:44,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:44,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:44,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 34 transitions. [2019-12-27 19:21:44,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:44,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:44,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:21:44,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:44,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:21:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:44,308 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 18 states. [2019-12-27 19:21:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:44,648 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-27 19:21:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 19:21:44,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-27 19:21:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:44,650 INFO L225 Difference]: With dead ends: 56 [2019-12-27 19:21:44,650 INFO L226 Difference]: Without dead ends: 53 [2019-12-27 19:21:44,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=717, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:21:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-27 19:21:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-27 19:21:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-27 19:21:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-27 19:21:44,653 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-27 19:21:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:44,653 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-27 19:21:44,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:21:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-27 19:21:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:44,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:44,654 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:44,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:44,858 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-27 19:21:44,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:44,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359144256] [2019-12-27 19:21:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:45,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359144256] [2019-12-27 19:21:45,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559986891] [2019-12-27 19:21:45,005 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:45,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:45,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:45,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 19:21:45,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:45,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:45,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 19:21:45,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636534925] [2019-12-27 19:21:45,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:45,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:45,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 30 transitions. [2019-12-27 19:21:45,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:45,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:21:45,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:45,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:21:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:21:45,107 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 18 states. [2019-12-27 19:21:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:45,545 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-27 19:21:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:21:45,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-27 19:21:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:45,546 INFO L225 Difference]: With dead ends: 57 [2019-12-27 19:21:45,547 INFO L226 Difference]: Without dead ends: 54 [2019-12-27 19:21:45,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 19:21:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-27 19:21:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-27 19:21:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-27 19:21:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-27 19:21:45,552 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-27 19:21:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:45,553 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-27 19:21:45,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:21:45,553 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-27 19:21:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:21:45,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:45,555 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:45,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:45,759 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-27 19:21:45,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:45,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477086026] [2019-12-27 19:21:45,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:45,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477086026] [2019-12-27 19:21:45,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640258483] [2019-12-27 19:21:45,917 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:45,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-27 19:21:45,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:45,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 19:21:45,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:45,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:45,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 19:21:45,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1281733539] [2019-12-27 19:21:45,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:45,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:46,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 35 transitions. [2019-12-27 19:21:46,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:46,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:46,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:21:46,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:21:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:21:46,007 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 19 states. [2019-12-27 19:21:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:46,352 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-27 19:21:46,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:21:46,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-27 19:21:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:46,353 INFO L225 Difference]: With dead ends: 58 [2019-12-27 19:21:46,354 INFO L226 Difference]: Without dead ends: 55 [2019-12-27 19:21:46,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=809, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 19:21:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-27 19:21:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-27 19:21:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-27 19:21:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-27 19:21:46,356 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-27 19:21:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:46,357 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-27 19:21:46,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:21:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-27 19:21:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:21:46,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:46,357 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:46,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:46,561 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-27 19:21:46,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:46,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268287507] [2019-12-27 19:21:46,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:46,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268287507] [2019-12-27 19:21:46,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113412188] [2019-12-27 19:21:46,720 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:46,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 19:21:46,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:46,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 19:21:46,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:46,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:46,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 19:21:46,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215099219] [2019-12-27 19:21:46,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:46,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:46,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 31 transitions. [2019-12-27 19:21:46,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:46,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:46,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:21:46,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:46,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:21:46,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:21:46,805 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 19 states. [2019-12-27 19:21:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:47,169 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-27 19:21:47,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:21:47,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-12-27 19:21:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:47,170 INFO L225 Difference]: With dead ends: 59 [2019-12-27 19:21:47,171 INFO L226 Difference]: Without dead ends: 56 [2019-12-27 19:21:47,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=847, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 19:21:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-27 19:21:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-27 19:21:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-27 19:21:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-27 19:21:47,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-27 19:21:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:47,175 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-27 19:21:47,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:21:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-27 19:21:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:47,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:47,176 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:47,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:47,380 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:47,380 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-27 19:21:47,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:47,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114919456] [2019-12-27 19:21:47,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:47,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114919456] [2019-12-27 19:21:47,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353749496] [2019-12-27 19:21:47,628 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:47,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 19:21:47,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:47,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:47,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 19:21:47,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750164041] [2019-12-27 19:21:47,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:47,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:47,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 36 transitions. [2019-12-27 19:21:47,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:47,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:47,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 19:21:47,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 19:21:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:21:47,777 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 20 states. [2019-12-27 19:21:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:48,153 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-27 19:21:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:21:48,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-12-27 19:21:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:48,154 INFO L225 Difference]: With dead ends: 60 [2019-12-27 19:21:48,155 INFO L226 Difference]: Without dead ends: 57 [2019-12-27 19:21:48,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=906, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 19:21:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-27 19:21:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-27 19:21:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-27 19:21:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-27 19:21:48,160 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-27 19:21:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:48,160 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-27 19:21:48,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 19:21:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-27 19:21:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 19:21:48,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:48,161 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:48,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:48,365 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-27 19:21:48,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:48,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872179608] [2019-12-27 19:21:48,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:48,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872179608] [2019-12-27 19:21:48,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298399587] [2019-12-27 19:21:48,566 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:48,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:21:48,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:48,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 19:21:48,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:48,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:48,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 19:21:48,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905497361] [2019-12-27 19:21:48,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:48,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:48,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 32 transitions. [2019-12-27 19:21:48,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:48,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:48,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 19:21:48,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 19:21:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:21:48,655 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 20 states. [2019-12-27 19:21:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:49,042 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-27 19:21:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 19:21:49,044 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-12-27 19:21:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:49,045 INFO L225 Difference]: With dead ends: 61 [2019-12-27 19:21:49,045 INFO L226 Difference]: Without dead ends: 58 [2019-12-27 19:21:49,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=460, Invalid=946, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 19:21:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-27 19:21:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-27 19:21:49,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-27 19:21:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-27 19:21:49,048 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-27 19:21:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:49,049 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-27 19:21:49,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 19:21:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-27 19:21:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:21:49,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:49,050 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:49,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:49,251 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-27 19:21:49,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:49,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503976185] [2019-12-27 19:21:49,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503976185] [2019-12-27 19:21:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143496579] [2019-12-27 19:21:49,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:49,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-27 19:21:49,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:49,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 19:21:49,565 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:49,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:49,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 19:21:49,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003726508] [2019-12-27 19:21:49,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 37 transitions. [2019-12-27 19:21:49,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:49,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:21:49,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:21:49,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:21:49,623 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 21 states. [2019-12-27 19:21:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,037 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-27 19:21:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 19:21:50,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 19:21:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,039 INFO L225 Difference]: With dead ends: 62 [2019-12-27 19:21:50,039 INFO L226 Difference]: Without dead ends: 59 [2019-12-27 19:21:50,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=473, Invalid=1009, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:21:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-27 19:21:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-27 19:21:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-27 19:21:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-27 19:21:50,043 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-27 19:21:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,043 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-27 19:21:50,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:21:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-27 19:21:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:21:50,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:50,043 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:50,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:50,244 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-27 19:21:50,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:50,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454826567] [2019-12-27 19:21:50,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:50,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454826567] [2019-12-27 19:21:50,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801795599] [2019-12-27 19:21:50,429 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:50,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:21:50,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:50,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 19:21:50,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:50,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:50,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 19:21:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266239215] [2019-12-27 19:21:50,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:50,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:50,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 33 transitions. [2019-12-27 19:21:50,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:50,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:50,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:21:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:21:50,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:21:50,532 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 21 states. [2019-12-27 19:21:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,923 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-27 19:21:50,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 19:21:50,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 19:21:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,925 INFO L225 Difference]: With dead ends: 63 [2019-12-27 19:21:50,925 INFO L226 Difference]: Without dead ends: 60 [2019-12-27 19:21:50,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=509, Invalid=1051, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 19:21:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-27 19:21:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-27 19:21:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-27 19:21:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-27 19:21:50,929 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-27 19:21:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,929 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-27 19:21:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:21:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-27 19:21:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:21:50,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:50,930 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:51,134 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:51,134 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-27 19:21:51,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:51,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143513033] [2019-12-27 19:21:51,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:51,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143513033] [2019-12-27 19:21:51,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627055761] [2019-12-27 19:21:51,362 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:51,415 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-27 19:21:51,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:51,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 19:21:51,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:51,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:51,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 19:21:51,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623523554] [2019-12-27 19:21:51,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:51,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:51,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 38 transitions. [2019-12-27 19:21:51,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:51,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:21:51,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:21:51,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:21:51,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:21:51,451 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 22 states. [2019-12-27 19:21:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:51,875 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-27 19:21:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 19:21:51,876 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-12-27 19:21:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:51,877 INFO L225 Difference]: With dead ends: 64 [2019-12-27 19:21:51,877 INFO L226 Difference]: Without dead ends: 61 [2019-12-27 19:21:51,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=523, Invalid=1117, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 19:21:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-27 19:21:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-27 19:21:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-27 19:21:51,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-27 19:21:51,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-27 19:21:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:51,881 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-27 19:21:51,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:21:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-27 19:21:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:21:51,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:51,881 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:52,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:52,085 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-27 19:21:52,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:52,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293136268] [2019-12-27 19:21:52,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:52,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293136268] [2019-12-27 19:21:52,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130926298] [2019-12-27 19:21:52,271 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:52,327 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-27 19:21:52,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:21:52,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 19:21:52,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:21:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:52,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:21:52,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 19:21:52,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969414853] [2019-12-27 19:21:52,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:52,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:52,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 34 transitions. [2019-12-27 19:21:52,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:52,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:21:52,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 19:21:52,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 19:21:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:21:52,361 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 22 states. [2019-12-27 19:21:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:52,828 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-27 19:21:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:21:52,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-12-27 19:21:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:52,829 INFO L225 Difference]: With dead ends: 65 [2019-12-27 19:21:52,830 INFO L226 Difference]: Without dead ends: 62 [2019-12-27 19:21:52,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:21:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-27 19:21:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-27 19:21:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-27 19:21:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-27 19:21:52,837 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-27 19:21:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:52,838 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-27 19:21:52,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 19:21:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-27 19:21:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:21:52,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:52,838 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:53,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:21:53,039 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:21:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-27 19:21:53,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:53,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244643540] [2019-12-27 19:21:53,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:21:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:21:53,091 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:21:53,092 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:21:53,095 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_~j~0_16 6) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= v_~i~0_16 3) (= 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_#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_16, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_10|, 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_14, 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_14, ~i~0=v_~i~0_16, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-27 19:21:53,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-27 19:21:53,096 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_10 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_10, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,097 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_10) (= |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_10, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (< v_t1Thread1of1ForFork1_~k~0_14 10) (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-27 19:21:53,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 10) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-27 19:21:53,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (= v_ULTIMATE.start_main_~condJ~0_11 0)) (.cse1 (= v_ULTIMATE.start_main_~condI~0_11 0))) (and (let ((.cse0 (<= 26 v_~i~0_12))) (or (and (= v_ULTIMATE.start_main_~condI~0_11 1) .cse0) (and .cse1 (not .cse0)))) (let ((.cse2 (<= 26 v_~j~0_12))) (or (and .cse2 (= v_ULTIMATE.start_main_~condJ~0_11 1)) (and (not .cse2) .cse3))) (or (not .cse3) (not .cse1)))) InVars {~j~0=v_~j~0_12, ~i~0=v_~i~0_12} OutVars{~j~0=v_~j~0_12, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_11, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_11, ~i~0=v_~i~0_12, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-27 19:21:53,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:21:53 BasicIcfg [2019-12-27 19:21:53,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:21:53,123 INFO L168 Benchmark]: Toolchain (without parser) took 26579.23 ms. Allocated memory was 144.7 MB in the beginning and 408.4 MB in the end (delta: 263.7 MB). Free memory was 101.0 MB in the beginning and 340.4 MB in the end (delta: -239.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,123 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 658.45 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 161.4 MB in the end (delta: -60.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.97 ms. Allocated memory is still 202.4 MB. Free memory was 161.4 MB in the beginning and 159.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,124 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 ms. Allocated memory is still 202.4 MB. Free memory was 159.4 MB in the beginning and 158.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,125 INFO L168 Benchmark]: RCFGBuilder took 411.25 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 138.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,125 INFO L168 Benchmark]: TraceAbstraction took 25430.82 ms. Allocated memory was 202.4 MB in the beginning and 408.4 MB in the end (delta: 206.0 MB). Free memory was 138.0 MB in the beginning and 340.4 MB in the end (delta: -202.4 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:53,127 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.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 658.45 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.6 MB in the beginning and 161.4 MB in the end (delta: -60.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.97 ms. Allocated memory is still 202.4 MB. Free memory was 161.4 MB in the beginning and 159.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.88 ms. Allocated memory is still 202.4 MB. Free memory was 159.4 MB in the beginning and 158.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.25 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 138.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25430.82 ms. Allocated memory was 202.4 MB in the beginning and 408.4 MB in the end (delta: 206.0 MB). Free memory was 138.0 MB in the beginning and 340.4 MB in the end (delta: -202.4 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 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, 0 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: 25.2s, OverallIterations: 39, TraceHistogramMax: 10, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 361 SDtfs, 1097 SDslu, 853 SDs, 0 SdLazy, 1248 SolverSat, 1284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1410 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 261 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 171 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 70324 SizeOfPredicates, 340 NumberOfNonLiveVariables, 4046 ConjunctsInSsa, 514 ConjunctsInUnsatCore, 72 InterpolantComputations, 4 PerfectInterpolantSequences, 0/2100 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...