/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/sigma.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:12:01,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:12:01,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:12:01,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:12:01,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:12:01,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:12:01,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:12:01,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:12:01,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:12:01,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:12:01,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:12:01,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:12:01,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:12:01,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:12:01,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:12:01,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:12:01,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:12:01,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:12:01,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:12:01,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:12:01,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:12:01,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:12:01,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:12:01,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:12:01,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:12:01,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:12:01,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:12:01,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:12:01,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:12:01,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:12:01,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:12:01,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:12:01,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:12:01,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:12:01,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:12:01,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:12:01,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:12:01,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:12:01,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:12:01,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:12:01,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:12:01,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:12:01,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:12:01,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:12:01,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:12:01,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:12:01,425 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:12:01,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:12:01,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:12:01,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:12:01,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:12:01,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:12:01,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:12:01,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:12:01,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:12:01,427 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:12:01,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:12:01,428 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:12:01,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:12:01,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:12:01,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:12:01,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:12:01,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:12:01,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:01,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:12:01,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:12:01,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:12:01,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:12:01,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:12:01,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:12:01,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:12:01,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:12:01,718 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:12:01,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/sigma.i [2019-12-27 15:12:01,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6c6246e/a510487879204204bd7042a4d0d4d643/FLAGd56c70bc2 [2019-12-27 15:12:02,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:12:02,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/sigma.i [2019-12-27 15:12:02,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6c6246e/a510487879204204bd7042a4d0d4d643/FLAGd56c70bc2 [2019-12-27 15:12:02,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6c6246e/a510487879204204bd7042a4d0d4d643 [2019-12-27 15:12:02,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:12:02,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:12:02,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:02,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:12:02,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:12:02,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:02" (1/1) ... [2019-12-27 15:12:02,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5b031d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:02, skipping insertion in model container [2019-12-27 15:12:02,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:12:02" (1/1) ... [2019-12-27 15:12:02,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:12:02,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:12:03,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:03,323 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:12:03,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:12:03,568 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:12:03,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03 WrapperNode [2019-12-27 15:12:03,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:12:03,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:03,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:12:03,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:12:03,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:12:03,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:12:03,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:12:03,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:12:03,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... [2019-12-27 15:12:03,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:12:03,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:12:03,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:12:03,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:12:03,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:12:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:12:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 15:12:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:12:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 15:12:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:12:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 15:12:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 15:12:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2019-12-27 15:12:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2019-12-27 15:12:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:12:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:12:03,754 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:12:04,195 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:12:04,195 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-27 15:12:04,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:04 BoogieIcfgContainer [2019-12-27 15:12:04,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:12:04,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:12:04,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:12:04,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:12:04,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:12:02" (1/3) ... [2019-12-27 15:12:04,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5508240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:04, skipping insertion in model container [2019-12-27 15:12:04,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:12:03" (2/3) ... [2019-12-27 15:12:04,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5508240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:12:04, skipping insertion in model container [2019-12-27 15:12:04,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:12:04" (3/3) ... [2019-12-27 15:12:04,207 INFO L109 eAbstractionObserver]: Analyzing ICFG sigma.i [2019-12-27 15:12:04,215 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:12:04,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:12:04,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 15:12:04,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:12:04,262 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,263 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,263 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,263 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,264 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,264 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,269 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,269 WARN L315 ript$VariableManager]: TermVariabe threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,269 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,269 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:04,288 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:04,306 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:04,306 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:04,307 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:04,307 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:04,307 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:04,307 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:04,307 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:04,307 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:04,319 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 74 transitions [2019-12-27 15:12:04,321 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions [2019-12-27 15:12:04,372 INFO L132 PetriNetUnfolder]: 11/111 cut-off events. [2019-12-27 15:12:04,373 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 15:12:04,378 INFO L76 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 111 events. 11/111 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2019-12-27 15:12:04,382 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions [2019-12-27 15:12:04,410 INFO L132 PetriNetUnfolder]: 11/111 cut-off events. [2019-12-27 15:12:04,411 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 15:12:04,412 INFO L76 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 111 events. 11/111 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2019-12-27 15:12:04,414 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 344 [2019-12-27 15:12:04,415 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:05,584 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:05,632 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:05,664 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,664 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:05,681 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:05,724 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:05,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:05,760 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:07,903 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-27 15:12:08,170 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,222 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:08,228 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:08,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,277 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:08,292 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:08,344 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:08,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:08,385 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:10,679 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-27 15:12:11,097 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-27 15:12:11,227 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 15:12:11,232 INFO L206 etLargeBlockEncoding]: Checked pairs total: 278 [2019-12-27 15:12:11,232 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-27 15:12:11,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 17 transitions [2019-12-27 15:12:11,245 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 36 states. [2019-12-27 15:12:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-12-27 15:12:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:12:11,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:11,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:12:11,256 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:11,264 INFO L82 PathProgramCache]: Analyzing trace with hash 8650828, now seen corresponding path program 1 times [2019-12-27 15:12:11,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:11,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351843439] [2019-12-27 15:12:11,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:11,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351843439] [2019-12-27 15:12:11,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:11,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:11,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067811038] [2019-12-27 15:12:11,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:11,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:11,553 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:12:11,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:11,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:11,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:11,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:11,579 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-12-27 15:12:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:11,640 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-12-27 15:12:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:11,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:12:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:11,653 INFO L225 Difference]: With dead ends: 31 [2019-12-27 15:12:11,653 INFO L226 Difference]: Without dead ends: 28 [2019-12-27 15:12:11,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-27 15:12:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-27 15:12:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-27 15:12:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-12-27 15:12:11,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 4 [2019-12-27 15:12:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:11,697 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-12-27 15:12:11,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-12-27 15:12:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:11,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:11,709 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-12-27 15:12:11,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:11,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:11,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1422843402, now seen corresponding path program 1 times [2019-12-27 15:12:11,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:11,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893477125] [2019-12-27 15:12:11,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:11,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:11,889 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:11,891 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:12:11,891 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 15:12:11,897 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,898 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,898 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,898 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,898 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,898 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,899 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,899 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,899 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,899 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,899 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,900 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,900 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,900 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,900 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,900 WARN L315 ript$VariableManager]: TermVariabe threadThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,902 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,902 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,902 WARN L315 ript$VariableManager]: TermVariabe threadThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,902 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:11,905 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:11,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:11,905 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:11,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:11,906 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:11,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:11,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:11,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:11,906 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:11,908 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 80 transitions [2019-12-27 15:12:11,908 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions [2019-12-27 15:12:11,950 INFO L132 PetriNetUnfolder]: 22/199 cut-off events. [2019-12-27 15:12:11,950 INFO L133 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2019-12-27 15:12:11,952 INFO L76 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 199 events. 22/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 423 event pairs. 0/169 useless extension candidates. Maximal degree in co-relation 113. Up to 8 conditions per place. [2019-12-27 15:12:11,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 78 places, 80 transitions [2019-12-27 15:12:11,991 INFO L132 PetriNetUnfolder]: 22/199 cut-off events. [2019-12-27 15:12:11,992 INFO L133 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2019-12-27 15:12:11,994 INFO L76 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 199 events. 22/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 423 event pairs. 0/169 useless extension candidates. Maximal degree in co-relation 113. Up to 8 conditions per place. [2019-12-27 15:12:11,999 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 824 [2019-12-27 15:12:11,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:12,434 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:12,465 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:12,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,499 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:12,511 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:12,537 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:12,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:12,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:15,092 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:15,135 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:15,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,169 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:15,181 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:15,225 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:15,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:15,266 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:17,815 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:17,854 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:17,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:17,907 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:17,945 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:17,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:17,984 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:20,096 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:20,149 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:20,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,189 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:20,200 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:20,264 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:20,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:20,304 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:22,475 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-27 15:12:22,838 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-27 15:12:22,945 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-12-27 15:12:22,949 INFO L206 etLargeBlockEncoding]: Checked pairs total: 733 [2019-12-27 15:12:22,950 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2019-12-27 15:12:22,950 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 22 transitions [2019-12-27 15:12:22,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109 states. [2019-12-27 15:12:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-12-27 15:12:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:12:22,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:22,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:12:22,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:22,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash 13330920, now seen corresponding path program 1 times [2019-12-27 15:12:22,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:22,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946455409] [2019-12-27 15:12:22,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:23,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946455409] [2019-12-27 15:12:23,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:23,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787514301] [2019-12-27 15:12:23,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:23,019 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:23,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:12:23,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:23,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:23,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:23,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:23,030 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-12-27 15:12:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:23,110 INFO L93 Difference]: Finished difference Result 110 states and 180 transitions. [2019-12-27 15:12:23,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:23,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:12:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:23,117 INFO L225 Difference]: With dead ends: 110 [2019-12-27 15:12:23,117 INFO L226 Difference]: Without dead ends: 103 [2019-12-27 15:12:23,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-27 15:12:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2019-12-27 15:12:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-27 15:12:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 164 transitions. [2019-12-27 15:12:23,135 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 164 transitions. Word has length 4 [2019-12-27 15:12:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:23,138 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 164 transitions. [2019-12-27 15:12:23,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 164 transitions. [2019-12-27 15:12:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:23,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:23,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:23,139 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1478794564, now seen corresponding path program 1 times [2019-12-27 15:12:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:23,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426441702] [2019-12-27 15:12:23,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:23,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426441702] [2019-12-27 15:12:23,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460717923] [2019-12-27 15:12:23,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:23,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:12:23,325 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:23,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:23,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 15:12:23,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914947192] [2019-12-27 15:12:23,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:23,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:23,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:12:23,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:23,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:23,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:23,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,392 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:12:23,396 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:23,399 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:23,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:23,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:1 [2019-12-27 15:12:23,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:12:23,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:23,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:23,404 INFO L87 Difference]: Start difference. First operand 97 states and 164 transitions. Second operand 4 states. [2019-12-27 15:12:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:23,439 INFO L93 Difference]: Finished difference Result 95 states and 159 transitions. [2019-12-27 15:12:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:23,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:12:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:23,442 INFO L225 Difference]: With dead ends: 95 [2019-12-27 15:12:23,443 INFO L226 Difference]: Without dead ends: 95 [2019-12-27 15:12:23,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-27 15:12:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-12-27 15:12:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-27 15:12:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2019-12-27 15:12:23,455 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 17 [2019-12-27 15:12:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:23,455 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2019-12-27 15:12:23,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2019-12-27 15:12:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:23,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:23,457 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-12-27 15:12:23,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:23,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash -273903233, now seen corresponding path program 1 times [2019-12-27 15:12:23,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:23,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986502520] [2019-12-27 15:12:23,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:23,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:23,728 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:23,728 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:12:23,728 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 15:12:23,734 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,734 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,735 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,735 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,735 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,735 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,735 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,736 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,737 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,737 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,737 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,737 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,737 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,738 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,738 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,738 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,738 WARN L315 ript$VariableManager]: TermVariabe threadThread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,740 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,740 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,740 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,740 WARN L315 ript$VariableManager]: TermVariabe threadThread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,741 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,742 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,742 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,742 WARN L315 ript$VariableManager]: TermVariabe threadThread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:23,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:23,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:23,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:23,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:23,749 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:23,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:23,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:23,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:23,750 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:23,755 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 86 transitions [2019-12-27 15:12:23,755 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions [2019-12-27 15:12:23,835 INFO L132 PetriNetUnfolder]: 44/358 cut-off events. [2019-12-27 15:12:23,835 INFO L133 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2019-12-27 15:12:23,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 358 events. 44/358 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1032 event pairs. 0/302 useless extension candidates. Maximal degree in co-relation 207. Up to 16 conditions per place. [2019-12-27 15:12:23,846 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 85 places, 86 transitions [2019-12-27 15:12:23,885 INFO L132 PetriNetUnfolder]: 44/358 cut-off events. [2019-12-27 15:12:23,885 INFO L133 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2019-12-27 15:12:23,888 INFO L76 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 358 events. 44/358 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1032 event pairs. 0/302 useless extension candidates. Maximal degree in co-relation 207. Up to 16 conditions per place. [2019-12-27 15:12:23,895 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1320 [2019-12-27 15:12:23,895 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:24,408 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:24,435 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:24,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:24,469 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:24,501 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:24,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:24,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:27,157 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:27,193 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:27,224 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,224 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:27,236 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:27,298 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:27,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:27,329 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:29,578 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:29,624 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:29,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,663 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:29,674 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:29,721 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:29,765 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:29,765 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:31,932 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-12-27 15:12:32,463 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-12-27 15:12:32,566 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 15:12:32,572 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1071 [2019-12-27 15:12:32,572 INFO L214 etLargeBlockEncoding]: Total number of compositions: 67 [2019-12-27 15:12:32,572 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions [2019-12-27 15:12:32,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 297 states. [2019-12-27 15:12:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states. [2019-12-27 15:12:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:12:32,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:12:32,583 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash 18343786, now seen corresponding path program 1 times [2019-12-27 15:12:32,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857432091] [2019-12-27 15:12:32,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:32,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857432091] [2019-12-27 15:12:32,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:32,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:32,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10392865] [2019-12-27 15:12:32,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,609 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:12:32,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:32,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:12:32,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:12:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:32,611 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 3 states. [2019-12-27 15:12:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,645 INFO L93 Difference]: Finished difference Result 297 states and 636 transitions. [2019-12-27 15:12:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:32,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 15:12:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,650 INFO L225 Difference]: With dead ends: 297 [2019-12-27 15:12:32,650 INFO L226 Difference]: Without dead ends: 268 [2019-12-27 15:12:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-27 15:12:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-12-27 15:12:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-12-27 15:12:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 580 transitions. [2019-12-27 15:12:32,674 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 580 transitions. Word has length 4 [2019-12-27 15:12:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,674 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 580 transitions. [2019-12-27 15:12:32,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:12:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 580 transitions. [2019-12-27 15:12:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:32,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -193871239, now seen corresponding path program 1 times [2019-12-27 15:12:32,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842099660] [2019-12-27 15:12:32,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 15:12:32,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842099660] [2019-12-27 15:12:32,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:32,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:32,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119673564] [2019-12-27 15:12:32,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 15:12:32,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:32,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:32,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:32,718 INFO L87 Difference]: Start difference. First operand 268 states and 580 transitions. Second operand 4 states. [2019-12-27 15:12:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,751 INFO L93 Difference]: Finished difference Result 299 states and 612 transitions. [2019-12-27 15:12:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:32,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 15:12:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,754 INFO L225 Difference]: With dead ends: 299 [2019-12-27 15:12:32,754 INFO L226 Difference]: Without dead ends: 299 [2019-12-27 15:12:32,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-27 15:12:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-12-27 15:12:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-27 15:12:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 577 transitions. [2019-12-27 15:12:32,771 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 577 transitions. Word has length 10 [2019-12-27 15:12:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,772 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 577 transitions. [2019-12-27 15:12:32,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 577 transitions. [2019-12-27 15:12:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:32,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:32,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1584588976, now seen corresponding path program 1 times [2019-12-27 15:12:32,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:32,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548507753] [2019-12-27 15:12:32,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548507753] [2019-12-27 15:12:32,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321382390] [2019-12-27 15:12:32,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:32,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:12:32,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:32,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:32,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 15:12:32,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1402658660] [2019-12-27 15:12:32,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:32,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:32,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:12:32,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:32,906 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:32,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:32,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:32,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:32,907 INFO L87 Difference]: Start difference. First operand 277 states and 577 transitions. Second operand 4 states. [2019-12-27 15:12:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:32,939 INFO L93 Difference]: Finished difference Result 275 states and 572 transitions. [2019-12-27 15:12:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:32,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:12:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:32,942 INFO L225 Difference]: With dead ends: 275 [2019-12-27 15:12:32,942 INFO L226 Difference]: Without dead ends: 275 [2019-12-27 15:12:32,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-27 15:12:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-12-27 15:12:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-27 15:12:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 572 transitions. [2019-12-27 15:12:32,954 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 572 transitions. Word has length 17 [2019-12-27 15:12:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:32,954 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 572 transitions. [2019-12-27 15:12:32,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 572 transitions. [2019-12-27 15:12:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:32,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:32,956 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:33,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2065278432, now seen corresponding path program 1 times [2019-12-27 15:12:33,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730902536] [2019-12-27 15:12:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:33,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730902536] [2019-12-27 15:12:33,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445891844] [2019-12-27 15:12:33,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:33,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:12:33,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:33,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:33,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 15:12:33,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872897184] [2019-12-27 15:12:33,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:33,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:33,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 27 transitions. [2019-12-27 15:12:33,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:33,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:33,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:33,366 INFO L87 Difference]: Start difference. First operand 275 states and 572 transitions. Second operand 5 states. [2019-12-27 15:12:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:33,414 INFO L93 Difference]: Finished difference Result 271 states and 560 transitions. [2019-12-27 15:12:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:33,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 15:12:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:33,416 INFO L225 Difference]: With dead ends: 271 [2019-12-27 15:12:33,416 INFO L226 Difference]: Without dead ends: 271 [2019-12-27 15:12:33,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-27 15:12:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-27 15:12:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-27 15:12:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 560 transitions. [2019-12-27 15:12:33,431 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 560 transitions. Word has length 23 [2019-12-27 15:12:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:33,432 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 560 transitions. [2019-12-27 15:12:33,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 560 transitions. [2019-12-27 15:12:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:33,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:33,433 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2019-12-27 15:12:33,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:33,637 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -319556423, now seen corresponding path program 1 times [2019-12-27 15:12:33,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:33,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536845437] [2019-12-27 15:12:33,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:33,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:33,684 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:33,684 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:12:33,684 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 15:12:33,694 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,695 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,708 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,715 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,716 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,718 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,718 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,718 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,719 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,719 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,719 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,719 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,719 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,720 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,720 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,720 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,720 WARN L315 ript$VariableManager]: TermVariabe threadThread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,721 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,722 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,722 WARN L315 ript$VariableManager]: TermVariabe threadThread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,722 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,723 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,724 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,724 WARN L315 ript$VariableManager]: TermVariabe threadThread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,724 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,725 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,726 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,726 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,726 WARN L315 ript$VariableManager]: TermVariabe threadThread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:33,730 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:33,731 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:33,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:33,731 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:33,731 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:33,731 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:33,731 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:33,731 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:33,731 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:33,735 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 92 transitions [2019-12-27 15:12:33,735 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 92 transitions [2019-12-27 15:12:33,829 INFO L132 PetriNetUnfolder]: 90/661 cut-off events. [2019-12-27 15:12:33,829 INFO L133 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2019-12-27 15:12:33,835 INFO L76 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 661 events. 90/661 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2629 event pairs. 0/555 useless extension candidates. Maximal degree in co-relation 378. Up to 32 conditions per place. [2019-12-27 15:12:33,850 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 92 transitions [2019-12-27 15:12:33,937 INFO L132 PetriNetUnfolder]: 90/661 cut-off events. [2019-12-27 15:12:33,938 INFO L133 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2019-12-27 15:12:33,943 INFO L76 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 661 events. 90/661 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2629 event pairs. 0/555 useless extension candidates. Maximal degree in co-relation 378. Up to 32 conditions per place. [2019-12-27 15:12:33,955 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1872 [2019-12-27 15:12:33,955 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:34,491 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:34,525 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:34,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,556 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:34,566 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:34,600 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:34,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:34,628 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:37,245 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:37,298 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:37,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,333 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:37,370 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:37,421 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:37,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:37,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:39,808 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 15:12:40,105 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-27 15:12:40,407 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 15:12:40,530 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 15:12:40,537 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1448 [2019-12-27 15:12:40,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 68 [2019-12-27 15:12:40,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 28 transitions [2019-12-27 15:12:40,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 817 states. [2019-12-27 15:12:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-12-27 15:12:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:12:40,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:40,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:12:40,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash 23578740, now seen corresponding path program 1 times [2019-12-27 15:12:40,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:40,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737934535] [2019-12-27 15:12:40,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:40,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737934535] [2019-12-27 15:12:40,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:40,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:40,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2085011917] [2019-12-27 15:12:40,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:40,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:40,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:12:40,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:40,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:40,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:40,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:40,602 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-12-27 15:12:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:40,649 INFO L93 Difference]: Finished difference Result 910 states and 2204 transitions. [2019-12-27 15:12:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:40,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:12:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:40,658 INFO L225 Difference]: With dead ends: 910 [2019-12-27 15:12:40,658 INFO L226 Difference]: Without dead ends: 843 [2019-12-27 15:12:40,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-12-27 15:12:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 781. [2019-12-27 15:12:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 15:12:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1934 transitions. [2019-12-27 15:12:40,695 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1934 transitions. Word has length 4 [2019-12-27 15:12:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:40,695 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1934 transitions. [2019-12-27 15:12:40,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1934 transitions. [2019-12-27 15:12:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:40,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:40,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:40,696 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -174506730, now seen corresponding path program 1 times [2019-12-27 15:12:40,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:40,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908198140] [2019-12-27 15:12:40,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:40,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908198140] [2019-12-27 15:12:40,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275585092] [2019-12-27 15:12:40,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:40,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:12:40,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:40,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:40,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 15:12:40,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312499479] [2019-12-27 15:12:40,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:40,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:40,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:12:40,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:40,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:40,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:40,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:12:40,901 INFO L87 Difference]: Start difference. First operand 781 states and 1934 transitions. Second operand 5 states. [2019-12-27 15:12:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:40,971 INFO L93 Difference]: Finished difference Result 834 states and 1946 transitions. [2019-12-27 15:12:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:40,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:12:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:40,977 INFO L225 Difference]: With dead ends: 834 [2019-12-27 15:12:40,978 INFO L226 Difference]: Without dead ends: 834 [2019-12-27 15:12:40,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-27 15:12:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 788. [2019-12-27 15:12:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 15:12:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1868 transitions. [2019-12-27 15:12:41,006 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1868 transitions. Word has length 17 [2019-12-27 15:12:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:41,006 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1868 transitions. [2019-12-27 15:12:41,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1868 transitions. [2019-12-27 15:12:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:12:41,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:41,008 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:41,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:41,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1444925388, now seen corresponding path program 1 times [2019-12-27 15:12:41,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:41,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130101811] [2019-12-27 15:12:41,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:41,270 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:41,270 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:41,271 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:12:41,271 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,279 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,280 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,281 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,282 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,283 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,284 WARN L315 ript$VariableManager]: TermVariabe threadThread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,294 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,294 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,295 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,295 WARN L315 ript$VariableManager]: TermVariabe threadThread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,296 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,296 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,297 WARN L315 ript$VariableManager]: TermVariabe threadThread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,297 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,298 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,298 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,299 WARN L315 ript$VariableManager]: TermVariabe threadThread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,299 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,300 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,300 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,300 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,301 WARN L315 ript$VariableManager]: TermVariabe threadThread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:41,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:41,306 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:41,307 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:41,307 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:41,307 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:41,307 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:41,307 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:41,307 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:41,307 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:41,308 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 98 transitions [2019-12-27 15:12:41,309 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions [2019-12-27 15:12:41,497 INFO L132 PetriNetUnfolder]: 188/1256 cut-off events. [2019-12-27 15:12:41,497 INFO L133 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2019-12-27 15:12:41,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1256 events. 188/1256 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6683 event pairs. 0/1052 useless extension candidates. Maximal degree in co-relation 706. Up to 80 conditions per place. [2019-12-27 15:12:41,540 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions [2019-12-27 15:12:41,731 INFO L132 PetriNetUnfolder]: 188/1256 cut-off events. [2019-12-27 15:12:41,731 INFO L133 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2019-12-27 15:12:41,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1256 events. 188/1256 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6683 event pairs. 0/1052 useless extension candidates. Maximal degree in co-relation 706. Up to 80 conditions per place. [2019-12-27 15:12:41,769 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2480 [2019-12-27 15:12:41,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:42,209 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:42,253 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:42,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,288 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:42,303 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:42,348 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:42,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:42,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:45,062 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:45,107 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:45,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,141 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:45,151 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:45,192 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:45,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:45,227 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:47,914 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:47,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:47,959 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:47,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:48,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:48,000 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:48,020 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:48,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:48,065 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:48,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:48,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:48,106 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:12:50,319 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-12-27 15:12:50,691 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-12-27 15:12:50,807 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 15:12:50,865 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2037 [2019-12-27 15:12:50,865 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 15:12:50,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions [2019-12-27 15:12:50,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2289 states. [2019-12-27 15:12:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states. [2019-12-27 15:12:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:12:50,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:50,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:12:50,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 29088089, now seen corresponding path program 1 times [2019-12-27 15:12:50,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:50,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644901940] [2019-12-27 15:12:50,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:50,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644901940] [2019-12-27 15:12:50,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:50,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:50,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777163795] [2019-12-27 15:12:50,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:50,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:50,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:12:50,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:50,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:50,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:12:50,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:12:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:50,977 INFO L87 Difference]: Start difference. First operand 2289 states. Second operand 3 states. [2019-12-27 15:12:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:51,026 INFO L93 Difference]: Finished difference Result 2289 states and 6658 transitions. [2019-12-27 15:12:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:12:51,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 15:12:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:51,045 INFO L225 Difference]: With dead ends: 2289 [2019-12-27 15:12:51,046 INFO L226 Difference]: Without dead ends: 2044 [2019-12-27 15:12:51,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:12:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-12-27 15:12:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2019-12-27 15:12:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-12-27 15:12:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 6008 transitions. [2019-12-27 15:12:51,140 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 6008 transitions. Word has length 4 [2019-12-27 15:12:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:51,140 INFO L462 AbstractCegarLoop]: Abstraction has 2044 states and 6008 transitions. [2019-12-27 15:12:51,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:12:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 6008 transitions. [2019-12-27 15:12:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:12:51,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:51,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:51,141 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 138335209, now seen corresponding path program 1 times [2019-12-27 15:12:51,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:51,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445314588] [2019-12-27 15:12:51,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 15:12:51,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445314588] [2019-12-27 15:12:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:12:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:12:51,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826128530] [2019-12-27 15:12:51,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:51,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:51,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 15:12:51,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:51,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:51,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:51,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:51,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:51,198 INFO L87 Difference]: Start difference. First operand 2044 states and 6008 transitions. Second operand 4 states. [2019-12-27 15:12:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:51,253 INFO L93 Difference]: Finished difference Result 2379 states and 6766 transitions. [2019-12-27 15:12:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:51,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 15:12:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:51,272 INFO L225 Difference]: With dead ends: 2379 [2019-12-27 15:12:51,273 INFO L226 Difference]: Without dead ends: 2379 [2019-12-27 15:12:51,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:12:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2019-12-27 15:12:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2221. [2019-12-27 15:12:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-12-27 15:12:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 6367 transitions. [2019-12-27 15:12:51,348 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 6367 transitions. Word has length 10 [2019-12-27 15:12:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:51,348 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 6367 transitions. [2019-12-27 15:12:51,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 6367 transitions. [2019-12-27 15:12:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:12:51,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:51,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:51,349 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1136182213, now seen corresponding path program 1 times [2019-12-27 15:12:51,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:51,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535743454] [2019-12-27 15:12:51,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:51,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535743454] [2019-12-27 15:12:51,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909567316] [2019-12-27 15:12:51,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:12:51,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:51,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:51,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 15:12:51,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528663690] [2019-12-27 15:12:51,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:51,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:51,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:12:51,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:51,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:51,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:12:51,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:12:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:51,486 INFO L87 Difference]: Start difference. First operand 2221 states and 6367 transitions. Second operand 4 states. [2019-12-27 15:12:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:51,527 INFO L93 Difference]: Finished difference Result 2219 states and 6362 transitions. [2019-12-27 15:12:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:12:51,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:12:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:51,545 INFO L225 Difference]: With dead ends: 2219 [2019-12-27 15:12:51,545 INFO L226 Difference]: Without dead ends: 2219 [2019-12-27 15:12:51,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:12:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2019-12-27 15:12:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2219. [2019-12-27 15:12:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2019-12-27 15:12:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 6362 transitions. [2019-12-27 15:12:51,620 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 6362 transitions. Word has length 17 [2019-12-27 15:12:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:51,621 INFO L462 AbstractCegarLoop]: Abstraction has 2219 states and 6362 transitions. [2019-12-27 15:12:51,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:12:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 6362 transitions. [2019-12-27 15:12:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:12:51,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:51,623 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:51,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash -130574714, now seen corresponding path program 1 times [2019-12-27 15:12:51,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:51,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710871633] [2019-12-27 15:12:51,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:51,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710871633] [2019-12-27 15:12:51,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917417726] [2019-12-27 15:12:51,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:51,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:12:51,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:52,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:52,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 15:12:52,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952039574] [2019-12-27 15:12:52,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:52,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:52,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 15:12:52,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:52,057 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:52,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:12:52,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:12:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:52,058 INFO L87 Difference]: Start difference. First operand 2219 states and 6362 transitions. Second operand 5 states. [2019-12-27 15:12:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:52,109 INFO L93 Difference]: Finished difference Result 2215 states and 6350 transitions. [2019-12-27 15:12:52,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:12:52,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 15:12:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:52,126 INFO L225 Difference]: With dead ends: 2215 [2019-12-27 15:12:52,126 INFO L226 Difference]: Without dead ends: 2215 [2019-12-27 15:12:52,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:12:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-27 15:12:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2215. [2019-12-27 15:12:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2019-12-27 15:12:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 6350 transitions. [2019-12-27 15:12:52,199 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 6350 transitions. Word has length 23 [2019-12-27 15:12:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:52,199 INFO L462 AbstractCegarLoop]: Abstraction has 2215 states and 6350 transitions. [2019-12-27 15:12:52,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:12:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 6350 transitions. [2019-12-27 15:12:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:12:52,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:52,201 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:52,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,404 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -255340588, now seen corresponding path program 1 times [2019-12-27 15:12:52,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:52,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329950654] [2019-12-27 15:12:52,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:52,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329950654] [2019-12-27 15:12:52,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982717980] [2019-12-27 15:12:52,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:52,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 15:12:52,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:52,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:52,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 15:12:52,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724451612] [2019-12-27 15:12:52,575 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:52,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:52,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 15:12:52,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:52,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:52,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:12:52,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:12:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:52,588 INFO L87 Difference]: Start difference. First operand 2215 states and 6350 transitions. Second operand 6 states. [2019-12-27 15:12:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:52,655 INFO L93 Difference]: Finished difference Result 2207 states and 6322 transitions. [2019-12-27 15:12:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:12:52,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 15:12:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:52,670 INFO L225 Difference]: With dead ends: 2207 [2019-12-27 15:12:52,670 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 15:12:52,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:12:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 15:12:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-12-27 15:12:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-12-27 15:12:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 6322 transitions. [2019-12-27 15:12:52,736 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 6322 transitions. Word has length 29 [2019-12-27 15:12:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:52,737 INFO L462 AbstractCegarLoop]: Abstraction has 2207 states and 6322 transitions. [2019-12-27 15:12:52,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:12:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 6322 transitions. [2019-12-27 15:12:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:12:52,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:52,739 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:52,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:52,949 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1503593471, now seen corresponding path program 1 times [2019-12-27 15:12:52,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112037322] [2019-12-27 15:12:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:53,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112037322] [2019-12-27 15:12:53,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682798472] [2019-12-27 15:12:53,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:53,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:12:53,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:12:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:12:53,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:12:53,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 15:12:53,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465545152] [2019-12-27 15:12:53,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:12:53,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:53,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-27 15:12:53,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:53,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:12:53,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:12:53,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:53,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:12:53,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:53,163 INFO L87 Difference]: Start difference. First operand 2207 states and 6322 transitions. Second operand 7 states. [2019-12-27 15:12:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:53,252 INFO L93 Difference]: Finished difference Result 2191 states and 6258 transitions. [2019-12-27 15:12:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:12:53,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 15:12:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:53,286 INFO L225 Difference]: With dead ends: 2191 [2019-12-27 15:12:53,286 INFO L226 Difference]: Without dead ends: 2191 [2019-12-27 15:12:53,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:12:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-12-27 15:12:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2191. [2019-12-27 15:12:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2019-12-27 15:12:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 6258 transitions. [2019-12-27 15:12:53,387 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 6258 transitions. Word has length 35 [2019-12-27 15:12:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:53,391 INFO L462 AbstractCegarLoop]: Abstraction has 2191 states and 6258 transitions. [2019-12-27 15:12:53,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:12:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 6258 transitions. [2019-12-27 15:12:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:12:53,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:53,393 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:53,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:53,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2016252618, now seen corresponding path program 1 times [2019-12-27 15:12:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:53,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397511455] [2019-12-27 15:12:53,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:12:53,646 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:12:53,646 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:12:53,647 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:12:53,647 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 15:12:53,655 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,655 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,655 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,655 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,656 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,657 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,658 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,659 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,660 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,661 WARN L315 ript$VariableManager]: TermVariabe threadThread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,662 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,662 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,662 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,663 WARN L315 ript$VariableManager]: TermVariabe threadThread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,664 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,664 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,664 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,664 WARN L315 ript$VariableManager]: TermVariabe threadThread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,665 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,665 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,666 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,666 WARN L315 ript$VariableManager]: TermVariabe threadThread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,667 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,667 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,667 WARN L315 ript$VariableManager]: TermVariabe threadThread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,667 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,668 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,669 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,669 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,669 WARN L315 ript$VariableManager]: TermVariabe threadThread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:12:53,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:12:53,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:12:53,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:12:53,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:12:53,675 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:12:53,675 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:12:53,675 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:12:53,675 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:12:53,675 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:12:53,676 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 104 transitions [2019-12-27 15:12:53,676 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions [2019-12-27 15:12:54,168 INFO L132 PetriNetUnfolder]: 398/2443 cut-off events. [2019-12-27 15:12:54,168 INFO L133 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2019-12-27 15:12:54,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 2443 events. 398/2443 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 16457 event pairs. 0/2045 useless extension candidates. Maximal degree in co-relation 1355. Up to 192 conditions per place. [2019-12-27 15:12:54,304 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions [2019-12-27 15:12:54,745 INFO L132 PetriNetUnfolder]: 398/2443 cut-off events. [2019-12-27 15:12:54,745 INFO L133 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2019-12-27 15:12:54,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 2443 events. 398/2443 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 16457 event pairs. 0/2045 useless extension candidates. Maximal degree in co-relation 1355. Up to 192 conditions per place. [2019-12-27 15:12:54,820 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3144 [2019-12-27 15:12:54,820 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:12:55,177 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:55,209 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:55,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:55,244 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:55,276 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:55,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:55,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:12:57,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,626 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:12:57,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,670 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,692 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:12:57,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,775 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,796 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:12:57,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,845 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:57,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:12:57,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:12:58,105 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:58,144 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:58,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,177 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:12:58,188 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:58,248 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:12:58,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:12:58,280 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:00,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,332 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,354 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:00,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,396 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,430 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:00,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,732 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,761 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:00,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,802 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,824 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:00,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,926 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:00,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:00,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:00,991 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:01,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:01,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:01,012 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:74 [2019-12-27 15:13:01,301 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:01,344 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:01,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,380 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:01,400 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:01,441 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:01,489 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:01,490 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:03,872 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 15:13:04,188 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-12-27 15:13:04,294 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-27 15:13:04,583 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-12-27 15:13:04,683 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2554 [2019-12-27 15:13:04,683 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2019-12-27 15:13:04,684 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 34 transitions [2019-12-27 15:13:05,127 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6529 states. [2019-12-27 15:13:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6529 states. [2019-12-27 15:13:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:13:05,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:05,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:13:05,128 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 34932643, now seen corresponding path program 1 times [2019-12-27 15:13:05,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:05,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481470849] [2019-12-27 15:13:05,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:05,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481470849] [2019-12-27 15:13:05,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:05,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:05,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543779095] [2019-12-27 15:13:05,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:05,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:05,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:13:05,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:05,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:05,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:13:05,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:13:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:05,160 INFO L87 Difference]: Start difference. First operand 6529 states. Second operand 3 states. [2019-12-27 15:13:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:05,229 INFO L93 Difference]: Finished difference Result 6529 states and 21447 transitions. [2019-12-27 15:13:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:13:05,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-27 15:13:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:05,355 INFO L225 Difference]: With dead ends: 6529 [2019-12-27 15:13:05,355 INFO L226 Difference]: Without dead ends: 5798 [2019-12-27 15:13:05,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2019-12-27 15:13:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 5798. [2019-12-27 15:13:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5798 states. [2019-12-27 15:13:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 19258 transitions. [2019-12-27 15:13:05,531 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 19258 transitions. Word has length 4 [2019-12-27 15:13:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:05,532 INFO L462 AbstractCegarLoop]: Abstraction has 5798 states and 19258 transitions. [2019-12-27 15:13:05,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:13:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 19258 transitions. [2019-12-27 15:13:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 15:13:05,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:05,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:05,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1745623254, now seen corresponding path program 1 times [2019-12-27 15:13:05,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:05,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085977543] [2019-12-27 15:13:05,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 15:13:05,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085977543] [2019-12-27 15:13:05,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:05,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:05,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859149759] [2019-12-27 15:13:05,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:05,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:05,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 15:13:05,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:05,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:05,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:13:05,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:13:05,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:05,570 INFO L87 Difference]: Start difference. First operand 5798 states and 19258 transitions. Second operand 4 states. [2019-12-27 15:13:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:05,637 INFO L93 Difference]: Finished difference Result 6779 states and 21955 transitions. [2019-12-27 15:13:05,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:13:05,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-27 15:13:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:05,667 INFO L225 Difference]: With dead ends: 6779 [2019-12-27 15:13:05,668 INFO L226 Difference]: Without dead ends: 6779 [2019-12-27 15:13:05,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2019-12-27 15:13:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 6397. [2019-12-27 15:13:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2019-12-27 15:13:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 20804 transitions. [2019-12-27 15:13:05,929 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 20804 transitions. Word has length 10 [2019-12-27 15:13:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:05,930 INFO L462 AbstractCegarLoop]: Abstraction has 6397 states and 20804 transitions. [2019-12-27 15:13:05,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:13:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 20804 transitions. [2019-12-27 15:13:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:05,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:05,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:05,931 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1760908010, now seen corresponding path program 1 times [2019-12-27 15:13:05,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:05,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336468263] [2019-12-27 15:13:05,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:06,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336468263] [2019-12-27 15:13:06,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500279593] [2019-12-27 15:13:06,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:06,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:13:06,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:06,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:06,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 15:13:06,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938390309] [2019-12-27 15:13:06,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:06,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:06,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:13:06,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:06,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:06,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:06,122 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:13:06,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:06,130 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:06,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:06,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:1 [2019-12-27 15:13:06,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:13:06,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:13:06,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:13:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:06,132 INFO L87 Difference]: Start difference. First operand 6397 states and 20804 transitions. Second operand 4 states. [2019-12-27 15:13:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:06,205 INFO L93 Difference]: Finished difference Result 6395 states and 20799 transitions. [2019-12-27 15:13:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:13:06,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:13:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:06,229 INFO L225 Difference]: With dead ends: 6395 [2019-12-27 15:13:06,229 INFO L226 Difference]: Without dead ends: 6395 [2019-12-27 15:13:06,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6395 states. [2019-12-27 15:13:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6395 to 6395. [2019-12-27 15:13:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-12-27 15:13:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 20799 transitions. [2019-12-27 15:13:06,910 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 20799 transitions. Word has length 17 [2019-12-27 15:13:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 6395 states and 20799 transitions. [2019-12-27 15:13:06,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:13:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 20799 transitions. [2019-12-27 15:13:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:13:06,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:06,912 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:07,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,119 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 854603708, now seen corresponding path program 1 times [2019-12-27 15:13:07,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031369089] [2019-12-27 15:13:07,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:07,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031369089] [2019-12-27 15:13:07,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372634920] [2019-12-27 15:13:07,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:13:07,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:07,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:07,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 15:13:07,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373905235] [2019-12-27 15:13:07,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:07,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:07,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 27 transitions. [2019-12-27 15:13:07,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:07,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,300 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,304 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,304 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:13:07,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:07,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:13:07,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:13:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:13:07,306 INFO L87 Difference]: Start difference. First operand 6395 states and 20799 transitions. Second operand 5 states. [2019-12-27 15:13:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:07,401 INFO L93 Difference]: Finished difference Result 6391 states and 20787 transitions. [2019-12-27 15:13:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:13:07,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 15:13:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:07,424 INFO L225 Difference]: With dead ends: 6391 [2019-12-27 15:13:07,425 INFO L226 Difference]: Without dead ends: 6391 [2019-12-27 15:13:07,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:13:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2019-12-27 15:13:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 6391. [2019-12-27 15:13:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6391 states. [2019-12-27 15:13:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6391 states to 6391 states and 20787 transitions. [2019-12-27 15:13:07,590 INFO L78 Accepts]: Start accepts. Automaton has 6391 states and 20787 transitions. Word has length 23 [2019-12-27 15:13:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:07,591 INFO L462 AbstractCegarLoop]: Abstraction has 6391 states and 20787 transitions. [2019-12-27 15:13:07,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:13:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6391 states and 20787 transitions. [2019-12-27 15:13:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:13:07,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:07,592 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:07,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1833018259, now seen corresponding path program 1 times [2019-12-27 15:13:07,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446250997] [2019-12-27 15:13:07,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446250997] [2019-12-27 15:13:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857230656] [2019-12-27 15:13:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 15:13:07,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:07,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:07,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 15:13:07,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553837214] [2019-12-27 15:13:07,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:07,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:07,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 33 transitions. [2019-12-27 15:13:07,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:07,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,992 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:13:07,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:07,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:13:07,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:07,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:13:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:13:07,995 INFO L87 Difference]: Start difference. First operand 6391 states and 20787 transitions. Second operand 6 states. [2019-12-27 15:13:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,061 INFO L93 Difference]: Finished difference Result 6383 states and 20759 transitions. [2019-12-27 15:13:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:13:08,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 15:13:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,082 INFO L225 Difference]: With dead ends: 6383 [2019-12-27 15:13:08,082 INFO L226 Difference]: Without dead ends: 6383 [2019-12-27 15:13:08,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:13:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2019-12-27 15:13:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6383. [2019-12-27 15:13:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6383 states. [2019-12-27 15:13:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6383 states to 6383 states and 20759 transitions. [2019-12-27 15:13:08,363 INFO L78 Accepts]: Start accepts. Automaton has 6383 states and 20759 transitions. Word has length 29 [2019-12-27 15:13:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,363 INFO L462 AbstractCegarLoop]: Abstraction has 6383 states and 20759 transitions. [2019-12-27 15:13:08,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:13:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6383 states and 20759 transitions. [2019-12-27 15:13:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:13:08,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,365 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:08,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:08,568 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1531059645, now seen corresponding path program 1 times [2019-12-27 15:13:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321800382] [2019-12-27 15:13:08,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:08,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321800382] [2019-12-27 15:13:08,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474027757] [2019-12-27 15:13:08,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:13:08,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:08,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:08,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 15:13:08,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1201354924] [2019-12-27 15:13:08,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,787 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 39 transitions. [2019-12-27 15:13:08,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,808 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,811 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:13:08,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:08,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:13:08,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:13:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:13:08,812 INFO L87 Difference]: Start difference. First operand 6383 states and 20759 transitions. Second operand 7 states. [2019-12-27 15:13:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,899 INFO L93 Difference]: Finished difference Result 6367 states and 20695 transitions. [2019-12-27 15:13:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:13:08,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 15:13:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,922 INFO L225 Difference]: With dead ends: 6367 [2019-12-27 15:13:08,923 INFO L226 Difference]: Without dead ends: 6367 [2019-12-27 15:13:08,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:13:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6367 states. [2019-12-27 15:13:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6367 to 6367. [2019-12-27 15:13:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6367 states. [2019-12-27 15:13:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6367 states to 6367 states and 20695 transitions. [2019-12-27 15:13:09,102 INFO L78 Accepts]: Start accepts. Automaton has 6367 states and 20695 transitions. Word has length 35 [2019-12-27 15:13:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:09,103 INFO L462 AbstractCegarLoop]: Abstraction has 6367 states and 20695 transitions. [2019-12-27 15:13:09,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:13:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6367 states and 20695 transitions. [2019-12-27 15:13:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:13:09,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:09,109 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:09,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:09,313 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1747629972, now seen corresponding path program 1 times [2019-12-27 15:13:09,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:09,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979502871] [2019-12-27 15:13:09,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:09,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979502871] [2019-12-27 15:13:09,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940094796] [2019-12-27 15:13:09,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:09,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 15:13:09,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:09,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:09,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-12-27 15:13:09,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259367425] [2019-12-27 15:13:09,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:09,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:09,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 45 transitions. [2019-12-27 15:13:09,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:09,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:09,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:09,640 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:09,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:09,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:09,643 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:5 [2019-12-27 15:13:09,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:13:09,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:13:09,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:13:09,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:13:09,645 INFO L87 Difference]: Start difference. First operand 6367 states and 20695 transitions. Second operand 8 states. [2019-12-27 15:13:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:09,749 INFO L93 Difference]: Finished difference Result 6335 states and 20551 transitions. [2019-12-27 15:13:09,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:13:09,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 15:13:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:09,766 INFO L225 Difference]: With dead ends: 6335 [2019-12-27 15:13:09,767 INFO L226 Difference]: Without dead ends: 6335 [2019-12-27 15:13:09,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:13:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6335 states. [2019-12-27 15:13:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6335 to 6335. [2019-12-27 15:13:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6335 states. [2019-12-27 15:13:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 20551 transitions. [2019-12-27 15:13:10,051 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 20551 transitions. Word has length 41 [2019-12-27 15:13:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:10,051 INFO L462 AbstractCegarLoop]: Abstraction has 6335 states and 20551 transitions. [2019-12-27 15:13:10,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:13:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 20551 transitions. [2019-12-27 15:13:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:13:10,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:10,055 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:10,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:10,266 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash 741042800, now seen corresponding path program 1 times [2019-12-27 15:13:10,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:10,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152696070] [2019-12-27 15:13:10,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:13:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:13:10,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:13:10,347 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:13:10,347 WARN L364 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:13:10,347 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,356 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,357 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,358 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,359 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,360 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,361 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,362 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,362 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,362 WARN L315 ript$VariableManager]: TermVariabe threadThread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,362 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,364 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,364 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,365 WARN L315 ript$VariableManager]: TermVariabe threadThread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,365 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,366 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,366 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,366 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,366 WARN L315 ript$VariableManager]: TermVariabe threadThread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,369 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,369 WARN L315 ript$VariableManager]: TermVariabe threadThread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,369 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,371 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,371 WARN L315 ript$VariableManager]: TermVariabe threadThread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,371 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,374 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,374 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,374 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,374 WARN L315 ript$VariableManager]: TermVariabe threadThread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,376 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,376 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,376 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,376 WARN L315 ript$VariableManager]: TermVariabe threadThread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:10,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:13:10,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:13:10,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:13:10,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:13:10,383 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:13:10,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:13:10,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:13:10,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:13:10,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:13:10,384 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 110 transitions [2019-12-27 15:13:10,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions [2019-12-27 15:13:11,438 INFO L132 PetriNetUnfolder]: 848/4830 cut-off events. [2019-12-27 15:13:11,439 INFO L133 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2019-12-27 15:13:11,471 INFO L76 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 4830 events. 848/4830 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 39222 event pairs. 0/4046 useless extension candidates. Maximal degree in co-relation 2661. Up to 448 conditions per place. [2019-12-27 15:13:11,549 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions [2019-12-27 15:13:12,396 INFO L132 PetriNetUnfolder]: 848/4830 cut-off events. [2019-12-27 15:13:12,396 INFO L133 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2019-12-27 15:13:12,429 INFO L76 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 4830 events. 848/4830 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 39222 event pairs. 0/4046 useless extension candidates. Maximal degree in co-relation 2661. Up to 448 conditions per place. [2019-12-27 15:13:12,495 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3864 [2019-12-27 15:13:12,495 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:13:12,675 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:12,702 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:12,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,723 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:13:12,737 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:12,765 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:12,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:12,788 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:13:14,973 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 15:13:15,801 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:15,837 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:15,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:15,875 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:15,919 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:15,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:15,949 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:18,440 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-12-27 15:13:18,510 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:18,549 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:18,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,579 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:18,587 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:18,644 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:18,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:18,672 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:20,989 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:21,049 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:21,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,104 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:21,117 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:21,167 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:21,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:21,202 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:23,350 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-12-27 15:13:23,669 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-27 15:13:23,795 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3195 [2019-12-27 15:13:23,795 INFO L214 etLargeBlockEncoding]: Total number of compositions: 78 [2019-12-27 15:13:23,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 37 transitions [2019-12-27 15:13:24,822 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18897 states. [2019-12-27 15:13:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 18897 states. [2019-12-27 15:13:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:13:24,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:24,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:13:24,823 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 40994171, now seen corresponding path program 1 times [2019-12-27 15:13:24,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:24,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730769139] [2019-12-27 15:13:24,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:24,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730769139] [2019-12-27 15:13:24,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:24,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:24,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688165333] [2019-12-27 15:13:24,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:24,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:24,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:13:24,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:24,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:24,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:13:24,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:13:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:24,860 INFO L87 Difference]: Start difference. First operand 18897 states. Second operand 4 states. [2019-12-27 15:13:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:25,004 INFO L93 Difference]: Finished difference Result 21592 states and 77556 transitions. [2019-12-27 15:13:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:13:25,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:13:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:25,047 INFO L225 Difference]: With dead ends: 21592 [2019-12-27 15:13:25,047 INFO L226 Difference]: Without dead ends: 19531 [2019-12-27 15:13:25,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19531 states. [2019-12-27 15:13:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19531 to 18637. [2019-12-27 15:13:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18637 states. [2019-12-27 15:13:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18637 states to 18637 states and 67705 transitions. [2019-12-27 15:13:26,525 INFO L78 Accepts]: Start accepts. Automaton has 18637 states and 67705 transitions. Word has length 4 [2019-12-27 15:13:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:26,526 INFO L462 AbstractCegarLoop]: Abstraction has 18637 states and 67705 transitions. [2019-12-27 15:13:26,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:13:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18637 states and 67705 transitions. [2019-12-27 15:13:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:26,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:26,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:26,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 71145926, now seen corresponding path program 1 times [2019-12-27 15:13:26,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441444111] [2019-12-27 15:13:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:26,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441444111] [2019-12-27 15:13:26,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741457320] [2019-12-27 15:13:26,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:26,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:13:26,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:26,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:26,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 15:13:26,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832343268] [2019-12-27 15:13:26,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:26,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:26,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:13:26,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:26,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:26,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:13:26,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:13:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:13:26,668 INFO L87 Difference]: Start difference. First operand 18637 states and 67705 transitions. Second operand 5 states. [2019-12-27 15:13:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:26,793 INFO L93 Difference]: Finished difference Result 21452 states and 75330 transitions. [2019-12-27 15:13:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:13:26,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:13:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:26,838 INFO L225 Difference]: With dead ends: 21452 [2019-12-27 15:13:26,838 INFO L226 Difference]: Without dead ends: 21452 [2019-12-27 15:13:26,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:13:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2019-12-27 15:13:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 20110. [2019-12-27 15:13:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20110 states. [2019-12-27 15:13:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20110 states to 20110 states and 70948 transitions. [2019-12-27 15:13:27,351 INFO L78 Accepts]: Start accepts. Automaton has 20110 states and 70948 transitions. Word has length 17 [2019-12-27 15:13:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:27,351 INFO L462 AbstractCegarLoop]: Abstraction has 20110 states and 70948 transitions. [2019-12-27 15:13:27,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:13:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20110 states and 70948 transitions. [2019-12-27 15:13:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 15:13:27,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:27,353 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:27,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:27,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1524488795, now seen corresponding path program 1 times [2019-12-27 15:13:27,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:27,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251922754] [2019-12-27 15:13:27,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-27 15:13:27,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251922754] [2019-12-27 15:13:27,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113643366] [2019-12-27 15:13:27,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:27,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:13:27,874 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-27 15:13:27,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:27,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-12-27 15:13:27,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438272606] [2019-12-27 15:13:27,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:27,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:27,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 40 transitions. [2019-12-27 15:13:27,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:27,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:27,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:13:27,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:13:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:13:27,928 INFO L87 Difference]: Start difference. First operand 20110 states and 70948 transitions. Second operand 6 states. [2019-12-27 15:13:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:28,081 INFO L93 Difference]: Finished difference Result 21137 states and 71956 transitions. [2019-12-27 15:13:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:13:28,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-27 15:13:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:28,116 INFO L225 Difference]: With dead ends: 21137 [2019-12-27 15:13:28,116 INFO L226 Difference]: Without dead ends: 21137 [2019-12-27 15:13:28,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:13:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2019-12-27 15:13:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 20019. [2019-12-27 15:13:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20019 states. [2019-12-27 15:13:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20019 states to 20019 states and 68739 transitions. [2019-12-27 15:13:28,601 INFO L78 Accepts]: Start accepts. Automaton has 20019 states and 68739 transitions. Word has length 30 [2019-12-27 15:13:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:28,601 INFO L462 AbstractCegarLoop]: Abstraction has 20019 states and 68739 transitions. [2019-12-27 15:13:28,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:13:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 20019 states and 68739 transitions. [2019-12-27 15:13:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:13:28,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:28,607 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:28,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:28,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 143720568, now seen corresponding path program 1 times [2019-12-27 15:13:28,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:28,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699601748] [2019-12-27 15:13:28,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-27 15:13:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699601748] [2019-12-27 15:13:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917868023] [2019-12-27 15:13:28,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:28,978 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 15:13:28,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 15:13:29,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:29,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 15:13:29,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016963156] [2019-12-27 15:13:29,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:29,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:29,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 57 transitions. [2019-12-27 15:13:29,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:29,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:29,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:13:29,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:13:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:13:29,053 INFO L87 Difference]: Start difference. First operand 20019 states and 68739 transitions. Second operand 7 states. [2019-12-27 15:13:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:29,426 INFO L93 Difference]: Finished difference Result 19366 states and 65474 transitions. [2019-12-27 15:13:29,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:13:29,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 15:13:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:29,466 INFO L225 Difference]: With dead ends: 19366 [2019-12-27 15:13:29,466 INFO L226 Difference]: Without dead ends: 19366 [2019-12-27 15:13:29,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:13:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2019-12-27 15:13:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 18808. [2019-12-27 15:13:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-12-27 15:13:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 64142 transitions. [2019-12-27 15:13:29,812 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 64142 transitions. Word has length 43 [2019-12-27 15:13:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:29,812 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 64142 transitions. [2019-12-27 15:13:29,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:13:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 64142 transitions. [2019-12-27 15:13:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:13:29,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:29,822 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:30,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:30,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1247564156, now seen corresponding path program 1 times [2019-12-27 15:13:30,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:30,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664905200] [2019-12-27 15:13:30,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:13:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:13:30,080 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:13:30,080 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:13:30,080 WARN L364 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:13:30,080 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2019-12-27 15:13:30,089 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,090 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,091 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,092 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,093 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,094 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,095 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,096 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,097 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,097 WARN L315 ript$VariableManager]: TermVariabe threadThread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,107 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,107 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,107 WARN L315 ript$VariableManager]: TermVariabe threadThread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,108 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,109 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,109 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,109 WARN L315 ript$VariableManager]: TermVariabe threadThread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,109 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,110 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,110 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,111 WARN L315 ript$VariableManager]: TermVariabe threadThread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,111 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,112 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,112 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,112 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,112 WARN L315 ript$VariableManager]: TermVariabe threadThread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,113 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,113 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,114 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,114 WARN L315 ript$VariableManager]: TermVariabe threadThread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,115 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,115 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,115 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,115 WARN L315 ript$VariableManager]: TermVariabe threadThread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,116 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,116 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,116 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,116 WARN L315 ript$VariableManager]: TermVariabe threadThread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:30,123 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:13:30,124 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:13:30,124 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:13:30,124 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:13:30,124 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:13:30,124 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:13:30,124 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:13:30,124 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:13:30,124 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:13:30,126 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 116 transitions [2019-12-27 15:13:30,126 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 120 places, 116 transitions [2019-12-27 15:13:32,547 INFO L132 PetriNetUnfolder]: 1810/9649 cut-off events. [2019-12-27 15:13:32,548 INFO L133 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2019-12-27 15:13:32,607 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 9649 events. 1810/9649 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 92296 event pairs. 0/8095 useless extension candidates. Maximal degree in co-relation 5313. Up to 1024 conditions per place. [2019-12-27 15:13:32,746 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 120 places, 116 transitions [2019-12-27 15:13:35,256 INFO L132 PetriNetUnfolder]: 1810/9649 cut-off events. [2019-12-27 15:13:35,256 INFO L133 PetriNetUnfolder]: For 1136/1136 co-relation queries the response was YES. [2019-12-27 15:13:35,315 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 9649 events. 1810/9649 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 92296 event pairs. 0/8095 useless extension candidates. Maximal degree in co-relation 5313. Up to 1024 conditions per place. [2019-12-27 15:13:35,454 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4640 [2019-12-27 15:13:35,454 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:13:36,565 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:36,612 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,657 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:36,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:36,670 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:36,720 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:36,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:36,756 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:13:39,144 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:39,188 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,222 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:39,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,223 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:39,234 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:39,281 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:39,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:13:39,323 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:13:41,696 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-27 15:13:41,966 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-12-27 15:13:42,286 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 15:13:42,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3778 [2019-12-27 15:13:42,386 INFO L214 etLargeBlockEncoding]: Total number of compositions: 81 [2019-12-27 15:13:42,386 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 40 transitions [2019-12-27 15:13:49,016 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55297 states. [2019-12-27 15:13:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 55297 states. [2019-12-27 15:13:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:13:49,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:49,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:13:49,017 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 47396195, now seen corresponding path program 1 times [2019-12-27 15:13:49,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:49,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075118524] [2019-12-27 15:13:49,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:49,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075118524] [2019-12-27 15:13:49,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:49,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:49,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113740824] [2019-12-27 15:13:49,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:49,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:49,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:13:49,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:49,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:49,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:13:49,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:13:49,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:49,053 INFO L87 Difference]: Start difference. First operand 55297 states. Second operand 4 states. [2019-12-27 15:13:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:49,391 INFO L93 Difference]: Finished difference Result 63134 states and 250644 transitions. [2019-12-27 15:13:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:13:49,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:13:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:49,526 INFO L225 Difference]: With dead ends: 63134 [2019-12-27 15:13:49,526 INFO L226 Difference]: Without dead ends: 56827 [2019-12-27 15:13:49,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:13:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56827 states. [2019-12-27 15:13:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56827 to 54781. [2019-12-27 15:13:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54781 states. [2019-12-27 15:13:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54781 states to 54781 states and 219674 transitions. [2019-12-27 15:13:51,330 INFO L78 Accepts]: Start accepts. Automaton has 54781 states and 219674 transitions. Word has length 4 [2019-12-27 15:13:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:51,330 INFO L462 AbstractCegarLoop]: Abstraction has 54781 states and 219674 transitions. [2019-12-27 15:13:51,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:13:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54781 states and 219674 transitions. [2019-12-27 15:13:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:51,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:51,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:51,331 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 686766067, now seen corresponding path program 1 times [2019-12-27 15:13:51,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:51,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98414359] [2019-12-27 15:13:51,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:51,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98414359] [2019-12-27 15:13:51,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422591946] [2019-12-27 15:13:51,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:51,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:13:51,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:51,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:51,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-12-27 15:13:51,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604001599] [2019-12-27 15:13:51,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:51,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:51,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 15:13:51,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:51,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:51,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:13:51,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:13:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:51,484 INFO L87 Difference]: Start difference. First operand 54781 states and 219674 transitions. Second operand 4 states. [2019-12-27 15:13:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:51,754 INFO L93 Difference]: Finished difference Result 54779 states and 219669 transitions. [2019-12-27 15:13:51,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:13:51,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 15:13:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:51,875 INFO L225 Difference]: With dead ends: 54779 [2019-12-27 15:13:51,875 INFO L226 Difference]: Without dead ends: 54779 [2019-12-27 15:13:51,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54779 states. [2019-12-27 15:13:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54779 to 54779. [2019-12-27 15:13:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54779 states. [2019-12-27 15:13:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54779 states to 54779 states and 219669 transitions. [2019-12-27 15:13:56,270 INFO L78 Accepts]: Start accepts. Automaton has 54779 states and 219669 transitions. Word has length 17 [2019-12-27 15:13:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:56,270 INFO L462 AbstractCegarLoop]: Abstraction has 54779 states and 219669 transitions. [2019-12-27 15:13:56,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:13:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54779 states and 219669 transitions. [2019-12-27 15:13:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:13:56,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:56,271 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:56,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:56,473 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1923464070, now seen corresponding path program 1 times [2019-12-27 15:13:56,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:56,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135065858] [2019-12-27 15:13:56,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:56,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135065858] [2019-12-27 15:13:56,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790767260] [2019-12-27 15:13:56,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:56,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:13:56,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:13:56,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:56,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-27 15:13:56,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342718423] [2019-12-27 15:13:56,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:56,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:56,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 15:13:56,630 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:56,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:56,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:13:56,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:13:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:13:56,631 INFO L87 Difference]: Start difference. First operand 54779 states and 219669 transitions. Second operand 5 states. [2019-12-27 15:13:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:56,904 INFO L93 Difference]: Finished difference Result 54775 states and 219657 transitions. [2019-12-27 15:13:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:13:56,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 15:13:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:57,026 INFO L225 Difference]: With dead ends: 54775 [2019-12-27 15:13:57,026 INFO L226 Difference]: Without dead ends: 54775 [2019-12-27 15:13:57,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:14:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54775 states. [2019-12-27 15:14:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54775 to 54775. [2019-12-27 15:14:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54775 states. [2019-12-27 15:14:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54775 states to 54775 states and 219657 transitions. [2019-12-27 15:14:00,978 INFO L78 Accepts]: Start accepts. Automaton has 54775 states and 219657 transitions. Word has length 23 [2019-12-27 15:14:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:00,978 INFO L462 AbstractCegarLoop]: Abstraction has 54775 states and 219657 transitions. [2019-12-27 15:14:00,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:14:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 54775 states and 219657 transitions. [2019-12-27 15:14:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 15:14:00,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:00,979 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:01,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:01,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash 353447834, now seen corresponding path program 1 times [2019-12-27 15:14:01,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:01,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678529415] [2019-12-27 15:14:01,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:01,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678529415] [2019-12-27 15:14:01,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671606605] [2019-12-27 15:14:01,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:01,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 15:14:01,340 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:01,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:01,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-12-27 15:14:01,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810144136] [2019-12-27 15:14:01,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:01,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:01,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 15:14:01,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:01,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:14:01,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:14:01,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:14:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:14:01,395 INFO L87 Difference]: Start difference. First operand 54775 states and 219657 transitions. Second operand 6 states. [2019-12-27 15:14:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:02,298 INFO L93 Difference]: Finished difference Result 54767 states and 219629 transitions. [2019-12-27 15:14:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:14:02,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 15:14:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:02,433 INFO L225 Difference]: With dead ends: 54767 [2019-12-27 15:14:02,433 INFO L226 Difference]: Without dead ends: 54767 [2019-12-27 15:14:02,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:14:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54767 states. [2019-12-27 15:14:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54767 to 54767. [2019-12-27 15:14:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54767 states. [2019-12-27 15:14:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54767 states to 54767 states and 219629 transitions. [2019-12-27 15:14:03,871 INFO L78 Accepts]: Start accepts. Automaton has 54767 states and 219629 transitions. Word has length 29 [2019-12-27 15:14:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:03,871 INFO L462 AbstractCegarLoop]: Abstraction has 54767 states and 219629 transitions. [2019-12-27 15:14:03,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:14:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 54767 states and 219629 transitions. [2019-12-27 15:14:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 15:14:03,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:03,873 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:04,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:04,076 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1586842415, now seen corresponding path program 1 times [2019-12-27 15:14:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:04,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909661496] [2019-12-27 15:14:04,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:04,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909661496] [2019-12-27 15:14:04,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696187299] [2019-12-27 15:14:04,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:04,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 15:14:04,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:04,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:04,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-12-27 15:14:04,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029245562] [2019-12-27 15:14:04,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:04,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:04,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-27 15:14:04,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:04,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:14:04,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:14:04,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:04,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:14:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:14:04,282 INFO L87 Difference]: Start difference. First operand 54767 states and 219629 transitions. Second operand 7 states. [2019-12-27 15:14:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:05,226 INFO L93 Difference]: Finished difference Result 54751 states and 219565 transitions. [2019-12-27 15:14:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:14:05,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 15:14:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:05,360 INFO L225 Difference]: With dead ends: 54751 [2019-12-27 15:14:05,361 INFO L226 Difference]: Without dead ends: 54751 [2019-12-27 15:14:05,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:14:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54751 states. [2019-12-27 15:14:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54751 to 54751. [2019-12-27 15:14:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54751 states. [2019-12-27 15:14:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54751 states to 54751 states and 219565 transitions. [2019-12-27 15:14:06,791 INFO L78 Accepts]: Start accepts. Automaton has 54751 states and 219565 transitions. Word has length 35 [2019-12-27 15:14:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:06,791 INFO L462 AbstractCegarLoop]: Abstraction has 54751 states and 219565 transitions. [2019-12-27 15:14:06,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:14:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 54751 states and 219565 transitions. [2019-12-27 15:14:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:14:06,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:06,794 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:06,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:06,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1977395589, now seen corresponding path program 1 times [2019-12-27 15:14:06,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:06,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305098543] [2019-12-27 15:14:06,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:07,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305098543] [2019-12-27 15:14:07,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246681458] [2019-12-27 15:14:07,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:07,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 15:14:07,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:07,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:07,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-12-27 15:14:07,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1098681016] [2019-12-27 15:14:07,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:07,294 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:07,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 15:14:07,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:07,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:14:07,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:14:07,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:14:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:14:07,319 INFO L87 Difference]: Start difference. First operand 54751 states and 219565 transitions. Second operand 8 states. [2019-12-27 15:14:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:09,858 INFO L93 Difference]: Finished difference Result 54719 states and 219421 transitions. [2019-12-27 15:14:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:14:09,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 15:14:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:10,080 INFO L225 Difference]: With dead ends: 54719 [2019-12-27 15:14:10,081 INFO L226 Difference]: Without dead ends: 54719 [2019-12-27 15:14:10,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:14:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54719 states. [2019-12-27 15:14:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54719 to 54719. [2019-12-27 15:14:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54719 states. [2019-12-27 15:14:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54719 states to 54719 states and 219421 transitions. [2019-12-27 15:14:12,197 INFO L78 Accepts]: Start accepts. Automaton has 54719 states and 219421 transitions. Word has length 41 [2019-12-27 15:14:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:12,198 INFO L462 AbstractCegarLoop]: Abstraction has 54719 states and 219421 transitions. [2019-12-27 15:14:12,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:14:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54719 states and 219421 transitions. [2019-12-27 15:14:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 15:14:12,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:12,202 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:12,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:12,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash 600385180, now seen corresponding path program 1 times [2019-12-27 15:14:12,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:12,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148588148] [2019-12-27 15:14:12,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:12,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148588148] [2019-12-27 15:14:12,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88281928] [2019-12-27 15:14:12,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:12,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:14:12,607 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:12,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:12,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-27 15:14:12,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385811337] [2019-12-27 15:14:12,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:12,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:12,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 53 transitions. [2019-12-27 15:14:12,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:12,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:14:12,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:12,736 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:14:12,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:12,738 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:14:12,738 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:1 [2019-12-27 15:14:12,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:14:12,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:14:12,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:12,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:14:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:14:12,739 INFO L87 Difference]: Start difference. First operand 54719 states and 219421 transitions. Second operand 9 states. [2019-12-27 15:14:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:13,595 INFO L93 Difference]: Finished difference Result 54655 states and 219101 transitions. [2019-12-27 15:14:13,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:14:13,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-27 15:14:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:13,726 INFO L225 Difference]: With dead ends: 54655 [2019-12-27 15:14:13,726 INFO L226 Difference]: Without dead ends: 54655 [2019-12-27 15:14:13,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:14:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54655 states. [2019-12-27 15:14:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54655 to 54655. [2019-12-27 15:14:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54655 states. [2019-12-27 15:14:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54655 states to 54655 states and 219101 transitions. [2019-12-27 15:14:15,172 INFO L78 Accepts]: Start accepts. Automaton has 54655 states and 219101 transitions. Word has length 47 [2019-12-27 15:14:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:15,172 INFO L462 AbstractCegarLoop]: Abstraction has 54655 states and 219101 transitions. [2019-12-27 15:14:15,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:14:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54655 states and 219101 transitions. [2019-12-27 15:14:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 15:14:15,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:15,180 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:15,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:15,383 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash 793869420, now seen corresponding path program 1 times [2019-12-27 15:14:15,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:15,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653697563] [2019-12-27 15:14:15,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:15,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653697563] [2019-12-27 15:14:15,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116340649] [2019-12-27 15:14:15,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:14:15,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:14:15,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:14:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:14:15,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:14:15,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-27 15:14:15,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938813882] [2019-12-27 15:14:15,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:14:15,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:14:15,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-27 15:14:15,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:14:15,742 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:14:15,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:14:15,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:14:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:14:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:14:15,742 INFO L87 Difference]: Start difference. First operand 54655 states and 219101 transitions. Second operand 10 states. [2019-12-27 15:14:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:14:16,603 INFO L93 Difference]: Finished difference Result 54527 states and 218397 transitions. [2019-12-27 15:14:16,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:14:16,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 15:14:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:14:16,741 INFO L225 Difference]: With dead ends: 54527 [2019-12-27 15:14:16,741 INFO L226 Difference]: Without dead ends: 54527 [2019-12-27 15:14:16,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:14:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2019-12-27 15:14:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 54527. [2019-12-27 15:14:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54527 states. [2019-12-27 15:14:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54527 states to 54527 states and 218397 transitions. [2019-12-27 15:14:18,190 INFO L78 Accepts]: Start accepts. Automaton has 54527 states and 218397 transitions. Word has length 53 [2019-12-27 15:14:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:14:18,190 INFO L462 AbstractCegarLoop]: Abstraction has 54527 states and 218397 transitions. [2019-12-27 15:14:18,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:14:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 54527 states and 218397 transitions. [2019-12-27 15:14:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 15:14:18,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:14:18,195 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:14:18,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:14:18,398 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:14:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:14:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1631424205, now seen corresponding path program 1 times [2019-12-27 15:14:18,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:14:18,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013817691] [2019-12-27 15:14:18,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:14:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:14:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:14:18,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:14:18,446 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:14:18,446 WARN L364 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 15:14:18,446 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2019-12-27 15:14:18,456 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,456 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,456 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,457 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,458 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,459 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,460 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,461 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,461 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,461 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,461 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,462 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,462 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,462 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,462 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,462 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,463 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe threadThread1of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,464 WARN L315 ript$VariableManager]: TermVariabe |threadThread1of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,466 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,466 WARN L315 ript$VariableManager]: TermVariabe |threadThread2of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,466 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,466 WARN L315 ript$VariableManager]: TermVariabe threadThread2of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,467 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,467 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,468 WARN L315 ript$VariableManager]: TermVariabe |threadThread3of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,468 WARN L315 ript$VariableManager]: TermVariabe threadThread3of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,469 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,469 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,469 WARN L315 ript$VariableManager]: TermVariabe |threadThread4of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,469 WARN L315 ript$VariableManager]: TermVariabe threadThread4of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,470 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,471 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,471 WARN L315 ript$VariableManager]: TermVariabe |threadThread5of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,471 WARN L315 ript$VariableManager]: TermVariabe threadThread5of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,472 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,472 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,472 WARN L315 ript$VariableManager]: TermVariabe |threadThread6of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,472 WARN L315 ript$VariableManager]: TermVariabe threadThread6of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,474 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,474 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,474 WARN L315 ript$VariableManager]: TermVariabe |threadThread7of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,474 WARN L315 ript$VariableManager]: TermVariabe threadThread7of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,476 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,476 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,476 WARN L315 ript$VariableManager]: TermVariabe threadThread8of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,476 WARN L315 ript$VariableManager]: TermVariabe |threadThread8of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,477 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,478 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,478 WARN L315 ript$VariableManager]: TermVariabe threadThread9of9ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,478 WARN L315 ript$VariableManager]: TermVariabe |threadThread9of9ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:14:18,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-27 15:14:18,486 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:14:18,486 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:14:18,486 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:14:18,486 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:14:18,486 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:14:18,487 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:14:18,487 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:14:18,487 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:14:18,489 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions [2019-12-27 15:14:18,489 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions [2019-12-27 15:14:27,624 INFO L132 PetriNetUnfolder]: 3860/19396 cut-off events. [2019-12-27 15:14:27,624 INFO L133 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2019-12-27 15:14:27,773 INFO L76 FinitePrefix]: Finished finitePrefix Result has 21773 conditions, 19396 events. 3860/19396 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 212691 event pairs. 0/16304 useless extension candidates. Maximal degree in co-relation 10719. Up to 2304 conditions per place. [2019-12-27 15:14:28,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions [2019-12-27 15:14:35,139 INFO L132 PetriNetUnfolder]: 3860/19396 cut-off events. [2019-12-27 15:14:35,139 INFO L133 PetriNetUnfolder]: For 2460/2460 co-relation queries the response was YES. [2019-12-27 15:14:35,287 INFO L76 FinitePrefix]: Finished finitePrefix Result has 21773 conditions, 19396 events. 3860/19396 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 212691 event pairs. 0/16304 useless extension candidates. Maximal degree in co-relation 10719. Up to 2304 conditions per place. [2019-12-27 15:14:35,629 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5472 [2019-12-27 15:14:35,629 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:14:35,654 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:35,677 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:35,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,694 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:14:35,705 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:35,735 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:35,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:35,756 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:134 [2019-12-27 15:14:39,062 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:39,098 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:39,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,128 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:14:39,145 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:39,191 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:39,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:39,232 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:140 [2019-12-27 15:14:41,780 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-27 15:14:41,840 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:41,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:41,905 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:41,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:41,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:41,958 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:14:41,971 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:42,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:42,038 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:42,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:14:42,092 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 15:14:42,092 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:146 [2019-12-27 15:14:44,475 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-12-27 15:14:44,602 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-27 15:14:45,046 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-12-27 15:14:45,205 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 15:14:45,306 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4435 [2019-12-27 15:14:45,306 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 15:14:45,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 43 transitions [2019-12-27 15:15:24,779 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 163089 states. [2019-12-27 15:15:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 163089 states. [2019-12-27 15:15:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:15:24,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:15:24,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:15:24,780 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:15:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:15:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 54015380, now seen corresponding path program 1 times [2019-12-27 15:15:24,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:15:24,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801257377] [2019-12-27 15:15:24,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:15:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:15:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:15:24,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801257377] [2019-12-27 15:15:24,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:15:24,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:15:24,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908827232] [2019-12-27 15:15:24,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:15:24,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:15:24,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:15:24,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:15:24,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:15:24,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:15:24,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:15:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:15:24,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:15:24,814 INFO L87 Difference]: Start difference. First operand 163089 states. Second operand 4 states. [2019-12-27 15:15:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:15:25,904 INFO L93 Difference]: Finished difference Result 185840 states and 807312 transitions. [2019-12-27 15:15:25,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:15:25,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-27 15:15:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:15:26,374 INFO L225 Difference]: With dead ends: 185840 [2019-12-27 15:15:26,374 INFO L226 Difference]: Without dead ends: 166667 [2019-12-27 15:15:26,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:15:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166667 states. [2019-12-27 15:15:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166667 to 162061. [2019-12-27 15:15:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162061 states. [2019-12-27 15:15:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162061 states to 162061 states and 710659 transitions. [2019-12-27 15:15:40,208 INFO L78 Accepts]: Start accepts. Automaton has 162061 states and 710659 transitions. Word has length 4 [2019-12-27 15:15:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:15:40,208 INFO L462 AbstractCegarLoop]: Abstraction has 162061 states and 710659 transitions. [2019-12-27 15:15:40,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:15:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 162061 states and 710659 transitions. [2019-12-27 15:15:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:15:40,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:15:40,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:15:40,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:15:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:15:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash 416229304, now seen corresponding path program 1 times [2019-12-27 15:15:40,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:15:40,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389422894] [2019-12-27 15:15:40,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:15:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:15:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:15:40,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389422894] [2019-12-27 15:15:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249469834] [2019-12-27 15:15:40,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:15:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:15:40,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:15:40,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:15:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 15:15:40,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:15:40,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-12-27 15:15:40,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467020715] [2019-12-27 15:15:40,370 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:15:40,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:15:40,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 15:15:40,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:15:40,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:15:40,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:15:40,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:15:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:15:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:15:40,385 INFO L87 Difference]: Start difference. First operand 162061 states and 710659 transitions. Second operand 5 states. [2019-12-27 15:15:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:15:48,748 INFO L93 Difference]: Finished difference Result 187620 states and 806014 transitions. [2019-12-27 15:15:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:15:48,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:15:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:15:49,289 INFO L225 Difference]: With dead ends: 187620 [2019-12-27 15:15:49,290 INFO L226 Difference]: Without dead ends: 187620 [2019-12-27 15:15:49,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 Received shutdown request... [2019-12-27 15:15:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187620 states. [2019-12-27 15:15:54,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:15:54,632 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 15:15:54,636 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 15:15:54,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:15:54 BasicIcfg [2019-12-27 15:15:54,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:15:54,638 INFO L168 Benchmark]: Toolchain (without parser) took 231998.75 ms. Allocated memory was 145.8 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,638 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 927.63 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 124.2 MB in the end (delta: -23.3 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.60 ms. Allocated memory is still 204.5 MB. Free memory was 123.5 MB in the beginning and 121.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,640 INFO L168 Benchmark]: Boogie Preprocessor took 32.26 ms. Allocated memory is still 204.5 MB. Free memory was 121.5 MB in the beginning and 119.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,640 INFO L168 Benchmark]: RCFGBuilder took 529.99 ms. Allocated memory is still 204.5 MB. Free memory was 119.5 MB in the beginning and 95.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,641 INFO L168 Benchmark]: TraceAbstraction took 230437.73 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 15:15:54,642 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 927.63 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 124.2 MB in the end (delta: -23.3 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.60 ms. Allocated memory is still 204.5 MB. Free memory was 123.5 MB in the beginning and 121.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.26 ms. Allocated memory is still 204.5 MB. Free memory was 121.5 MB in the beginning and 119.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.99 ms. Allocated memory is still 204.5 MB. Free memory was 119.5 MB in the beginning and 95.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230437.73 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.9s, 71 ProgramPointsBefore, 17 ProgramPointsAfterwards, 74 TransitionsBefore, 17 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 166 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 13 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.6s, 0 MoverChecksTotal, 278 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.0s, 78 ProgramPointsBefore, 23 ProgramPointsAfterwards, 80 TransitionsBefore, 22 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 386 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 23 SemBasedMoverChecksNegative, 4 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 9.0s, 0 MoverChecksTotal, 733 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 85 ProgramPointsBefore, 27 ProgramPointsAfterwards, 86 TransitionsBefore, 25 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 614 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.7s, 0 MoverChecksTotal, 1071 CheckedPairsTotal, 67 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 92 ProgramPointsBefore, 31 ProgramPointsAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 882 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 16 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.5s, 0 MoverChecksTotal, 1448 CheckedPairsTotal, 68 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.5s, 99 ProgramPointsBefore, 35 ProgramPointsAfterwards, 98 TransitionsBefore, 31 TransitionsAfterwards, 2480 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 1216 VarBasedMoverChecksPositive, 22 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.7s, 0 MoverChecksTotal, 2037 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 11.0s, 106 ProgramPointsBefore, 39 ProgramPointsAfterwards, 104 TransitionsBefore, 34 TransitionsAfterwards, 3144 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 1476 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 7.4s, 0 MoverChecksTotal, 2554 CheckedPairsTotal, 75 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 13.4s, 113 ProgramPointsBefore, 43 ProgramPointsAfterwards, 110 TransitionsBefore, 37 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 1793 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 4 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 8.9s, 0 MoverChecksTotal, 3195 CheckedPairsTotal, 78 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 12.2s, 120 ProgramPointsBefore, 47 ProgramPointsAfterwards, 116 TransitionsBefore, 40 TransitionsAfterwards, 4640 CoEnabledTransitionPairs, 7 FixpointIterations, 19 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 4 ChoiceCompositions, 2191 VarBasedMoverChecksPositive, 22 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 2 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.5s, 0 MoverChecksTotal, 3778 CheckedPairsTotal, 81 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 26.8s, 127 ProgramPointsBefore, 51 ProgramPointsAfterwards, 122 TransitionsBefore, 43 TransitionsAfterwards, 5472 CoEnabledTransitionPairs, 6 FixpointIterations, 19 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 4 ChoiceCompositions, 2586 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 3 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 6.8s, 0 MoverChecksTotal, 4435 CheckedPairsTotal, 84 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Result: TIMEOUT, OverallTime: 96.1s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 181 SDslu, 96 SDs, 0 SdLazy, 46 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163089occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.9s AutomataMinimizationTime, 2 MinimizatonAttempts, 4606 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 1831 SizeOfPredicates, 1 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/6 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 could not prove your program: Timeout Completed graceful shutdown