/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-ext/13_unverif.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:24:48,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:24:48,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:24:48,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:24:48,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:24:48,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:24:48,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:24:48,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:24:48,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:24:48,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:24:48,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:24:48,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:24:48,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:24:48,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:24:48,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:24:48,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:24:48,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:24:48,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:24:48,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:24:48,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:24:48,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:24:48,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:24:48,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:24:48,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:24:48,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:24:48,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:24:48,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:24:48,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:24:48,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:24:48,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:24:48,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:24:48,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:24:48,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:24:48,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:24:48,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:24:48,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:24:48,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:24:48,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:24:48,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:24:48,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:24:48,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:24:48,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:24:48,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:24:48,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:24:48,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:24:48,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:24:48,639 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:24:48,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:24:48,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:24:48,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:24:48,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:24:48,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:24:48,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:24:48,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:24:48,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:24:48,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:24:48,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:24:48,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:24:48,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:24:48,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:24:48,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:24:48,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:24:48,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:24:48,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:24:48,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:24:48,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:24:48,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:24:48,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:24:48,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:24:48,644 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:24:48,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:24:48,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:24:48,645 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:24:48,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:24:48,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:24:48,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:24:48,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:24:48,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:24:48,921 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:24:48,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/13_unverif.i [2019-12-27 19:24:48,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d40fdd34/a82fe213efc9472b9598e821590db07b/FLAG1c45e4ddd [2019-12-27 19:24:49,513 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:24:49,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/13_unverif.i [2019-12-27 19:24:49,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d40fdd34/a82fe213efc9472b9598e821590db07b/FLAG1c45e4ddd [2019-12-27 19:24:49,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d40fdd34/a82fe213efc9472b9598e821590db07b [2019-12-27 19:24:49,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:24:49,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:24:49,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:24:49,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:24:49,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:24:49,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:24:49" (1/1) ... [2019-12-27 19:24:49,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35038064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:49, skipping insertion in model container [2019-12-27 19:24:49,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:24:49" (1/1) ... [2019-12-27 19:24:49,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:24:49,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:24:50,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:24:50,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:24:50,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:24:50,544 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:24:50,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50 WrapperNode [2019-12-27 19:24:50,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:24:50,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:24:50,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:24:50,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:24:50,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:24:50,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:24:50,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:24:50,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:24:50,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... [2019-12-27 19:24:50,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:24:50,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:24:50,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:24:50,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:24:50,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:24:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:24:50,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:24:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:24:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:24:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:24:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:24:50,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:24:50,678 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:24:50,815 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_inc_r_returnLabel [2019-12-27 19:24:50,972 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:24:50,972 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-27 19:24:50,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:24:50 BoogieIcfgContainer [2019-12-27 19:24:50,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:24:50,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:24:50,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:24:50,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:24:50,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:24:49" (1/3) ... [2019-12-27 19:24:50,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4ec6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:24:50, skipping insertion in model container [2019-12-27 19:24:50,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:24:50" (2/3) ... [2019-12-27 19:24:50,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4ec6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:24:50, skipping insertion in model container [2019-12-27 19:24:50,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:24:50" (3/3) ... [2019-12-27 19:24:50,984 INFO L109 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2019-12-27 19:24:51,005 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:24:51,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:24:51,022 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:24:51,023 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:24:51,049 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,049 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,050 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,050 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,050 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,052 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,053 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,053 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,053 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,054 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,054 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,058 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,059 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,059 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,060 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,060 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:51,076 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 19:24:51,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:24:51,093 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:24:51,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:24:51,093 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:24:51,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:24:51,094 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:24:51,094 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:24:51,094 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:24:51,107 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 31 transitions [2019-12-27 19:24:51,109 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 31 places, 31 transitions [2019-12-27 19:24:51,142 INFO L132 PetriNetUnfolder]: 4/39 cut-off events. [2019-12-27 19:24:51,143 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:24:51,148 INFO L76 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs. 0/32 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 19:24:51,150 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 31 places, 31 transitions [2019-12-27 19:24:51,164 INFO L132 PetriNetUnfolder]: 4/39 cut-off events. [2019-12-27 19:24:51,164 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:24:51,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs. 0/32 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-27 19:24:51,167 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-27 19:24:51,168 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:24:51,883 INFO L206 etLargeBlockEncoding]: Checked pairs total: 169 [2019-12-27 19:24:51,884 INFO L214 etLargeBlockEncoding]: Total number of compositions: 27 [2019-12-27 19:24:51,887 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 10 places, 10 transitions [2019-12-27 19:24:51,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24 states. [2019-12-27 19:24:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-12-27 19:24:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 19:24:51,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:51,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 19:24:51,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:24:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 144192241, now seen corresponding path program 1 times [2019-12-27 19:24:51,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:51,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605250724] [2019-12-27 19:24:51,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:52,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605250724] [2019-12-27 19:24:52,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:52,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:24:52,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070054813] [2019-12-27 19:24:52,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:52,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:52,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 19:24:52,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:52,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:52,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:24:52,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:24:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:52,277 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-12-27 19:24:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:52,309 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-12-27 19:24:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:24:52,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-27 19:24:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:52,335 INFO L225 Difference]: With dead ends: 23 [2019-12-27 19:24:52,335 INFO L226 Difference]: Without dead ends: 23 [2019-12-27 19:24:52,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-27 19:24:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-27 19:24:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-27 19:24:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2019-12-27 19:24:52,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2019-12-27 19:24:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:52,389 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2019-12-27 19:24:52,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:24:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-12-27 19:24:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 19:24:52,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:52,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 19:24:52,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:24:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 174992566, now seen corresponding path program 1 times [2019-12-27 19:24:52,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:52,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217794306] [2019-12-27 19:24:52,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:52,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217794306] [2019-12-27 19:24:52,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:52,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:24:52,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117585006] [2019-12-27 19:24:52,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:52,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:52,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 19:24:52,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:52,568 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:52,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:24:52,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:24:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:24:52,572 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2019-12-27 19:24:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:52,596 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-12-27 19:24:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:24:52,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 19:24:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:52,598 INFO L225 Difference]: With dead ends: 19 [2019-12-27 19:24:52,598 INFO L226 Difference]: Without dead ends: 19 [2019-12-27 19:24:52,599 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 19:24:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-27 19:24:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-12-27 19:24:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-27 19:24:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2019-12-27 19:24:52,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 6 [2019-12-27 19:24:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:52,608 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2019-12-27 19:24:52,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:24:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2019-12-27 19:24:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 19:24:52,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:52,609 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-27 19:24:52,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:24:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 174947503, now seen corresponding path program 1 times [2019-12-27 19:24:52,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:52,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437356190] [2019-12-27 19:24:52,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:52,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:24:52,696 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:24:52,697 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:24:52,697 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 19:24:52,707 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,721 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,722 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,722 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:52,727 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 19:24:52,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:24:52,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:24:52,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:24:52,728 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:24:52,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:24:52,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:24:52,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:24:52,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:24:52,732 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 44 transitions [2019-12-27 19:24:52,732 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions [2019-12-27 19:24:52,751 INFO L132 PetriNetUnfolder]: 7/61 cut-off events. [2019-12-27 19:24:52,751 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:24:52,753 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 61 events. 7/61 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2019-12-27 19:24:52,756 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions [2019-12-27 19:24:52,770 INFO L132 PetriNetUnfolder]: 7/61 cut-off events. [2019-12-27 19:24:52,770 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:24:52,771 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 61 events. 7/61 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2019-12-27 19:24:52,774 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-27 19:24:52,774 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:24:53,259 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1527 [2019-12-27 19:24:53,259 INFO L214 etLargeBlockEncoding]: Total number of compositions: 28 [2019-12-27 19:24:53,260 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 21 transitions [2019-12-27 19:24:53,273 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 242 states. [2019-12-27 19:24:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-12-27 19:24:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:24:53,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:53,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:53,275 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:53,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash -318478320, now seen corresponding path program 1 times [2019-12-27 19:24:53,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:53,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919084966] [2019-12-27 19:24:53,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:53,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919084966] [2019-12-27 19:24:53,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:53,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:53,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880418713] [2019-12-27 19:24:53,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:53,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:53,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:24:53,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:53,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:53,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:24:53,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:24:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:53,394 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 5 states. [2019-12-27 19:24:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:53,480 INFO L93 Difference]: Finished difference Result 278 states and 739 transitions. [2019-12-27 19:24:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:24:53,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-27 19:24:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:53,496 INFO L225 Difference]: With dead ends: 278 [2019-12-27 19:24:53,496 INFO L226 Difference]: Without dead ends: 278 [2019-12-27 19:24:53,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-27 19:24:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 238. [2019-12-27 19:24:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-27 19:24:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 633 transitions. [2019-12-27 19:24:53,564 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 633 transitions. Word has length 7 [2019-12-27 19:24:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:53,564 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 633 transitions. [2019-12-27 19:24:53,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:24:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 633 transitions. [2019-12-27 19:24:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:24:53,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:53,569 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-27 19:24:53,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2063189442, now seen corresponding path program 1 times [2019-12-27 19:24:53,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:53,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695954905] [2019-12-27 19:24:53,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:53,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:24:53,615 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:24:53,615 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:24:53,615 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 19:24:53,623 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,625 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,625 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,625 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,626 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,626 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,627 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,628 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,628 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,629 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,637 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,638 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,638 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,638 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,638 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,640 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,640 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,640 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,640 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,641 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:53,643 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:24:53,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:24:53,643 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:24:53,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:24:53,644 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:24:53,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:24:53,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:24:53,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:24:53,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:24:53,647 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 57 transitions [2019-12-27 19:24:53,648 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions [2019-12-27 19:24:53,679 INFO L132 PetriNetUnfolder]: 10/83 cut-off events. [2019-12-27 19:24:53,679 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:24:53,681 INFO L76 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 10/83 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs. 0/66 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2019-12-27 19:24:53,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions [2019-12-27 19:24:53,698 INFO L132 PetriNetUnfolder]: 10/83 cut-off events. [2019-12-27 19:24:53,699 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:24:53,701 INFO L76 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 10/83 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 192 event pairs. 0/66 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2019-12-27 19:24:53,704 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-27 19:24:53,704 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:24:54,192 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3846 [2019-12-27 19:24:54,192 INFO L214 etLargeBlockEncoding]: Total number of compositions: 37 [2019-12-27 19:24:54,193 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 29 transitions [2019-12-27 19:24:54,261 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1456 states. [2019-12-27 19:24:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states. [2019-12-27 19:24:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:24:54,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:54,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:54,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash 679007988, now seen corresponding path program 1 times [2019-12-27 19:24:54,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:54,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681928455] [2019-12-27 19:24:54,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:54,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681928455] [2019-12-27 19:24:54,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:54,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:54,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118653375] [2019-12-27 19:24:54,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:54,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:54,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:24:54,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:54,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:54,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:24:54,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:54,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:24:54,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:54,335 INFO L87 Difference]: Start difference. First operand 1456 states. Second operand 5 states. [2019-12-27 19:24:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:54,447 INFO L93 Difference]: Finished difference Result 1766 states and 6426 transitions. [2019-12-27 19:24:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:24:54,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-27 19:24:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:54,466 INFO L225 Difference]: With dead ends: 1766 [2019-12-27 19:24:54,467 INFO L226 Difference]: Without dead ends: 1766 [2019-12-27 19:24:54,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-12-27 19:24:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1375. [2019-12-27 19:24:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-12-27 19:24:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 5020 transitions. [2019-12-27 19:24:54,543 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 5020 transitions. Word has length 7 [2019-12-27 19:24:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:54,544 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 5020 transitions. [2019-12-27 19:24:54,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:24:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 5020 transitions. [2019-12-27 19:24:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:24:54,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:54,545 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:54,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:54,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash -308361575, now seen corresponding path program 1 times [2019-12-27 19:24:54,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:54,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705584538] [2019-12-27 19:24:54,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:54,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705584538] [2019-12-27 19:24:54,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:54,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:54,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787018657] [2019-12-27 19:24:54,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:54,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:54,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:24:54,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:54,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:54,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:24:54,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:24:54,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:54,615 INFO L87 Difference]: Start difference. First operand 1375 states and 5020 transitions. Second operand 4 states. [2019-12-27 19:24:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:54,747 INFO L93 Difference]: Finished difference Result 1759 states and 6445 transitions. [2019-12-27 19:24:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:24:54,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:24:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:54,766 INFO L225 Difference]: With dead ends: 1759 [2019-12-27 19:24:54,766 INFO L226 Difference]: Without dead ends: 1759 [2019-12-27 19:24:54,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-12-27 19:24:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1457. [2019-12-27 19:24:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-27 19:24:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 5350 transitions. [2019-12-27 19:24:54,832 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 5350 transitions. Word has length 9 [2019-12-27 19:24:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:54,832 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 5350 transitions. [2019-12-27 19:24:54,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:24:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 5350 transitions. [2019-12-27 19:24:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:24:54,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:54,834 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:54,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1571029315, now seen corresponding path program 1 times [2019-12-27 19:24:54,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:54,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604227826] [2019-12-27 19:24:54,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:24:54,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604227826] [2019-12-27 19:24:54,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:54,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:54,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120018391] [2019-12-27 19:24:54,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:54,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:54,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:24:54,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:54,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:54,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:24:54,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:24:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:54,900 INFO L87 Difference]: Start difference. First operand 1457 states and 5350 transitions. Second operand 5 states. [2019-12-27 19:24:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:54,972 INFO L93 Difference]: Finished difference Result 1901 states and 6945 transitions. [2019-12-27 19:24:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:24:54,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 19:24:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:54,990 INFO L225 Difference]: With dead ends: 1901 [2019-12-27 19:24:54,990 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 19:24:54,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 19:24:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1620. [2019-12-27 19:24:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2019-12-27 19:24:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 5934 transitions. [2019-12-27 19:24:55,094 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 5934 transitions. Word has length 10 [2019-12-27 19:24:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:55,095 INFO L462 AbstractCegarLoop]: Abstraction has 1620 states and 5934 transitions. [2019-12-27 19:24:55,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:24:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 5934 transitions. [2019-12-27 19:24:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:24:55,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:55,098 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:55,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:55,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2069312604, now seen corresponding path program 1 times [2019-12-27 19:24:55,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:55,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284787422] [2019-12-27 19:24:55,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:24:55,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284787422] [2019-12-27 19:24:55,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:55,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:55,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980200388] [2019-12-27 19:24:55,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:55,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:55,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 13 states and 12 transitions. [2019-12-27 19:24:55,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:55,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:55,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:24:55,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:24:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:55,201 INFO L87 Difference]: Start difference. First operand 1620 states and 5934 transitions. Second operand 4 states. [2019-12-27 19:24:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:55,324 INFO L93 Difference]: Finished difference Result 1956 states and 7185 transitions. [2019-12-27 19:24:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:24:55,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:24:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:55,341 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 19:24:55,342 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 19:24:55,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 19:24:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1716. [2019-12-27 19:24:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-12-27 19:24:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 6322 transitions. [2019-12-27 19:24:55,419 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 6322 transitions. Word has length 12 [2019-12-27 19:24:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:55,419 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 6322 transitions. [2019-12-27 19:24:55,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:24:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 6322 transitions. [2019-12-27 19:24:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:24:55,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:55,426 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-27 19:24:55,426 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:24:55,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:55,426 INFO L82 PathProgramCache]: Analyzing trace with hash 351828682, now seen corresponding path program 1 times [2019-12-27 19:24:55,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:55,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602735447] [2019-12-27 19:24:55,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:24:55,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:24:55,462 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:24:55,462 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:24:55,462 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 19:24:55,470 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,470 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,473 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,473 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,475 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,475 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,476 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,476 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,476 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,476 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,476 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,477 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,478 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,482 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,482 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,485 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,485 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,487 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,487 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,488 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,490 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,491 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,493 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,493 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,493 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:24:55,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:24:55,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:24:55,498 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:24:55,498 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:24:55,498 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:24:55,498 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:24:55,498 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:24:55,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:24:55,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:24:55,499 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 70 transitions [2019-12-27 19:24:55,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions [2019-12-27 19:24:55,527 INFO L132 PetriNetUnfolder]: 13/105 cut-off events. [2019-12-27 19:24:55,528 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:24:55,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 105 events. 13/105 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs. 0/83 useless extension candidates. Maximal degree in co-relation 92. Up to 10 conditions per place. [2019-12-27 19:24:55,536 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions [2019-12-27 19:24:55,554 INFO L132 PetriNetUnfolder]: 13/105 cut-off events. [2019-12-27 19:24:55,554 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:24:55,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 105 events. 13/105 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs. 0/83 useless extension candidates. Maximal degree in co-relation 92. Up to 10 conditions per place. [2019-12-27 19:24:55,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 19:24:55,561 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:24:56,144 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6703 [2019-12-27 19:24:56,145 INFO L214 etLargeBlockEncoding]: Total number of compositions: 43 [2019-12-27 19:24:56,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 39 transitions [2019-12-27 19:24:57,283 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11890 states. [2019-12-27 19:24:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11890 states. [2019-12-27 19:24:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:24:57,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:57,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:57,284 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:24:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1894692225, now seen corresponding path program 1 times [2019-12-27 19:24:57,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:57,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031639869] [2019-12-27 19:24:57,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:57,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031639869] [2019-12-27 19:24:57,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:57,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:57,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503337296] [2019-12-27 19:24:57,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:57,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:57,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:24:57,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:57,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:57,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:24:57,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:24:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:57,368 INFO L87 Difference]: Start difference. First operand 11890 states. Second operand 5 states. [2019-12-27 19:24:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:57,658 INFO L93 Difference]: Finished difference Result 12881 states and 59621 transitions. [2019-12-27 19:24:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:24:57,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-27 19:24:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:57,759 INFO L225 Difference]: With dead ends: 12881 [2019-12-27 19:24:57,760 INFO L226 Difference]: Without dead ends: 12881 [2019-12-27 19:24:57,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:24:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12881 states. [2019-12-27 19:24:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12881 to 10414. [2019-12-27 19:24:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-27 19:24:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 48368 transitions. [2019-12-27 19:24:58,391 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 48368 transitions. Word has length 7 [2019-12-27 19:24:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:24:58,391 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 48368 transitions. [2019-12-27 19:24:58,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:24:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 48368 transitions. [2019-12-27 19:24:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:24:58,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:24:58,392 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:24:58,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:24:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:24:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -266923908, now seen corresponding path program 1 times [2019-12-27 19:24:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:24:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207701018] [2019-12-27 19:24:58,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:24:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:24:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:24:59,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207701018] [2019-12-27 19:24:59,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:24:59,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:24:59,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1952213970] [2019-12-27 19:24:59,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:24:59,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:24:59,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:24:59,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:24:59,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:24:59,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:24:59,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:24:59,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:24:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:59,084 INFO L87 Difference]: Start difference. First operand 10414 states and 48368 transitions. Second operand 4 states. [2019-12-27 19:24:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:24:59,372 INFO L93 Difference]: Finished difference Result 13720 states and 63827 transitions. [2019-12-27 19:24:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:24:59,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:24:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:24:59,456 INFO L225 Difference]: With dead ends: 13720 [2019-12-27 19:24:59,456 INFO L226 Difference]: Without dead ends: 13720 [2019-12-27 19:24:59,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:24:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13720 states. [2019-12-27 19:24:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13720 to 11882. [2019-12-27 19:24:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11882 states. [2019-12-27 19:25:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11882 states to 11882 states and 55338 transitions. [2019-12-27 19:25:00,061 INFO L78 Accepts]: Start accepts. Automaton has 11882 states and 55338 transitions. Word has length 9 [2019-12-27 19:25:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:00,062 INFO L462 AbstractCegarLoop]: Abstraction has 11882 states and 55338 transitions. [2019-12-27 19:25:00,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 11882 states and 55338 transitions. [2019-12-27 19:25:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:25:00,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:00,063 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:00,063 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:00,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1346173357, now seen corresponding path program 1 times [2019-12-27 19:25:00,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:00,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407636738] [2019-12-27 19:25:00,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:25:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407636738] [2019-12-27 19:25:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204195352] [2019-12-27 19:25:00,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:00,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:00,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:25:00,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:00,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:00,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:00,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:00,119 INFO L87 Difference]: Start difference. First operand 11882 states and 55338 transitions. Second operand 5 states. [2019-12-27 19:25:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:00,334 INFO L93 Difference]: Finished difference Result 14603 states and 67754 transitions. [2019-12-27 19:25:00,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:00,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 19:25:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:00,411 INFO L225 Difference]: With dead ends: 14603 [2019-12-27 19:25:00,411 INFO L226 Difference]: Without dead ends: 14603 [2019-12-27 19:25:00,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2019-12-27 19:25:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 12579. [2019-12-27 19:25:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12579 states. [2019-12-27 19:25:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12579 states to 12579 states and 58491 transitions. [2019-12-27 19:25:01,082 INFO L78 Accepts]: Start accepts. Automaton has 12579 states and 58491 transitions. Word has length 10 [2019-12-27 19:25:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:01,083 INFO L462 AbstractCegarLoop]: Abstraction has 12579 states and 58491 transitions. [2019-12-27 19:25:01,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12579 states and 58491 transitions. [2019-12-27 19:25:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:25:01,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:01,084 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:01,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 887448628, now seen corresponding path program 1 times [2019-12-27 19:25:01,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:01,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55922476] [2019-12-27 19:25:01,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:25:01,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55922476] [2019-12-27 19:25:01,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:01,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:01,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859319991] [2019-12-27 19:25:01,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:01,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:01,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 13 states and 12 transitions. [2019-12-27 19:25:01,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:01,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:01,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:25:01,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:25:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:01,139 INFO L87 Difference]: Start difference. First operand 12579 states and 58491 transitions. Second operand 4 states. [2019-12-27 19:25:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:01,697 INFO L93 Difference]: Finished difference Result 16611 states and 77337 transitions. [2019-12-27 19:25:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:25:01,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:25:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:01,835 INFO L225 Difference]: With dead ends: 16611 [2019-12-27 19:25:01,835 INFO L226 Difference]: Without dead ends: 16611 [2019-12-27 19:25:01,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16611 states. [2019-12-27 19:25:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16611 to 14745. [2019-12-27 19:25:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14745 states. [2019-12-27 19:25:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14745 states to 14745 states and 68743 transitions. [2019-12-27 19:25:03,665 INFO L78 Accepts]: Start accepts. Automaton has 14745 states and 68743 transitions. Word has length 12 [2019-12-27 19:25:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:03,666 INFO L462 AbstractCegarLoop]: Abstraction has 14745 states and 68743 transitions. [2019-12-27 19:25:03,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14745 states and 68743 transitions. [2019-12-27 19:25:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:25:03,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:03,668 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:03,668 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:03,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1569221179, now seen corresponding path program 1 times [2019-12-27 19:25:03,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:03,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161484279] [2019-12-27 19:25:03,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 19:25:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161484279] [2019-12-27 19:25:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253305737] [2019-12-27 19:25:03,741 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 19:25:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:03,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 19:25:03,844 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:25:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 19:25:03,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:25:03,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2019-12-27 19:25:03,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184278411] [2019-12-27 19:25:03,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:03,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:03,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 35 transitions. [2019-12-27 19:25:03,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:03,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:25:03,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:03,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:03,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:25:03,976 INFO L87 Difference]: Start difference. First operand 14745 states and 68743 transitions. Second operand 5 states. [2019-12-27 19:25:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:04,119 INFO L93 Difference]: Finished difference Result 2267 states and 8210 transitions. [2019-12-27 19:25:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:04,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:25:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:04,132 INFO L225 Difference]: With dead ends: 2267 [2019-12-27 19:25:04,133 INFO L226 Difference]: Without dead ends: 2267 [2019-12-27 19:25:04,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:25:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2019-12-27 19:25:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1856. [2019-12-27 19:25:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-27 19:25:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 6612 transitions. [2019-12-27 19:25:04,199 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 6612 transitions. Word has length 13 [2019-12-27 19:25:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:04,199 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 6612 transitions. [2019-12-27 19:25:04,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 6612 transitions. [2019-12-27 19:25:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:25:04,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:04,201 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:04,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:25:04,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1530307197, now seen corresponding path program 1 times [2019-12-27 19:25:04,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:04,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546367970] [2019-12-27 19:25:04,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:25:04,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546367970] [2019-12-27 19:25:04,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:04,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:04,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646402578] [2019-12-27 19:25:04,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:04,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:04,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:25:04,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:04,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:04,544 INFO L87 Difference]: Start difference. First operand 1856 states and 6612 transitions. Second operand 5 states. [2019-12-27 19:25:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:04,654 INFO L93 Difference]: Finished difference Result 3101 states and 11085 transitions. [2019-12-27 19:25:04,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:04,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:25:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:04,666 INFO L225 Difference]: With dead ends: 3101 [2019-12-27 19:25:04,666 INFO L226 Difference]: Without dead ends: 3101 [2019-12-27 19:25:04,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-27 19:25:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2126. [2019-12-27 19:25:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-27 19:25:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 7602 transitions. [2019-12-27 19:25:04,728 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 7602 transitions. Word has length 13 [2019-12-27 19:25:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:04,728 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 7602 transitions. [2019-12-27 19:25:04,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 7602 transitions. [2019-12-27 19:25:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:25:04,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:04,730 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:04,730 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1746398055, now seen corresponding path program 1 times [2019-12-27 19:25:04,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:04,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310154557] [2019-12-27 19:25:04,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:25:04,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310154557] [2019-12-27 19:25:04,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:04,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760720626] [2019-12-27 19:25:04,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:04,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:04,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:25:04,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:04,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:25:04,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:25:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:04,812 INFO L87 Difference]: Start difference. First operand 2126 states and 7602 transitions. Second operand 4 states. [2019-12-27 19:25:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:04,864 INFO L93 Difference]: Finished difference Result 1856 states and 6612 transitions. [2019-12-27 19:25:04,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:25:04,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:25:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:04,871 INFO L225 Difference]: With dead ends: 1856 [2019-12-27 19:25:04,871 INFO L226 Difference]: Without dead ends: 1856 [2019-12-27 19:25:04,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2019-12-27 19:25:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1586. [2019-12-27 19:25:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-12-27 19:25:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 5622 transitions. [2019-12-27 19:25:04,913 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 5622 transitions. Word has length 15 [2019-12-27 19:25:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:04,913 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 5622 transitions. [2019-12-27 19:25:04,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 5622 transitions. [2019-12-27 19:25:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:25:04,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:04,915 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:04,915 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:25:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash -452078714, now seen corresponding path program 1 times [2019-12-27 19:25:04,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:04,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646308274] [2019-12-27 19:25:04,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:25:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:25:04,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:25:04,932 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:25:04,933 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:25:04,933 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 19:25:04,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,946 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,947 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,948 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,950 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,950 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,956 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,957 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,957 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,957 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,957 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,959 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,959 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,959 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,959 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,961 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,962 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,962 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,962 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,962 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,964 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,964 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,966 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,967 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,967 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,967 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,967 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:04,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 19:25:04,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:25:04,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:25:04,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:25:04,969 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:25:04,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:25:04,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:25:04,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:25:04,970 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:25:04,971 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 83 transitions [2019-12-27 19:25:04,971 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 83 places, 83 transitions [2019-12-27 19:25:04,989 INFO L132 PetriNetUnfolder]: 16/127 cut-off events. [2019-12-27 19:25:04,989 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:25:04,993 INFO L76 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 127 events. 16/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 19:25:05,000 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 83 places, 83 transitions [2019-12-27 19:25:05,022 INFO L132 PetriNetUnfolder]: 16/127 cut-off events. [2019-12-27 19:25:05,023 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:25:05,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 127 events. 16/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-27 19:25:05,033 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-27 19:25:05,034 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:25:05,764 INFO L206 etLargeBlockEncoding]: Checked pairs total: 9864 [2019-12-27 19:25:05,764 INFO L214 etLargeBlockEncoding]: Total number of compositions: 53 [2019-12-27 19:25:05,765 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 47 transitions [2019-12-27 19:25:21,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 71348 states. [2019-12-27 19:25:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71348 states. [2019-12-27 19:25:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:25:21,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:21,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:21,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1540890265, now seen corresponding path program 1 times [2019-12-27 19:25:21,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:21,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256580496] [2019-12-27 19:25:21,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:21,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 19:25:21,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256580496] [2019-12-27 19:25:21,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:21,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:21,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397351185] [2019-12-27 19:25:21,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:21,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:21,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:25:21,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:21,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:21,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:21,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:21,978 INFO L87 Difference]: Start difference. First operand 71348 states. Second operand 5 states. [2019-12-27 19:25:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:24,840 INFO L93 Difference]: Finished difference Result 73196 states and 411721 transitions. [2019-12-27 19:25:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:24,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-27 19:25:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:25,163 INFO L225 Difference]: With dead ends: 73196 [2019-12-27 19:25:25,163 INFO L226 Difference]: Without dead ends: 73196 [2019-12-27 19:25:25,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73196 states. [2019-12-27 19:25:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73196 to 60826. [2019-12-27 19:25:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60826 states. [2019-12-27 19:25:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60826 states to 60826 states and 343170 transitions. [2019-12-27 19:25:28,026 INFO L78 Accepts]: Start accepts. Automaton has 60826 states and 343170 transitions. Word has length 7 [2019-12-27 19:25:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:28,026 INFO L462 AbstractCegarLoop]: Abstraction has 60826 states and 343170 transitions. [2019-12-27 19:25:28,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 60826 states and 343170 transitions. [2019-12-27 19:25:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:25:28,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:28,027 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:28,027 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash 968163332, now seen corresponding path program 1 times [2019-12-27 19:25:28,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:28,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038328874] [2019-12-27 19:25:28,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:25:28,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038328874] [2019-12-27 19:25:28,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:28,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:28,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618109373] [2019-12-27 19:25:28,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:28,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:28,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:25:28,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:28,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:28,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:25:28,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:25:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:28,087 INFO L87 Difference]: Start difference. First operand 60826 states and 343170 transitions. Second operand 4 states. [2019-12-27 19:25:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:32,158 INFO L93 Difference]: Finished difference Result 82861 states and 467763 transitions. [2019-12-27 19:25:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:25:32,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-27 19:25:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:32,537 INFO L225 Difference]: With dead ends: 82861 [2019-12-27 19:25:32,537 INFO L226 Difference]: Without dead ends: 82861 [2019-12-27 19:25:32,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82861 states. [2019-12-27 19:25:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82861 to 72662. [2019-12-27 19:25:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72662 states. [2019-12-27 19:25:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72662 states to 72662 states and 410462 transitions. [2019-12-27 19:25:38,122 INFO L78 Accepts]: Start accepts. Automaton has 72662 states and 410462 transitions. Word has length 9 [2019-12-27 19:25:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:38,122 INFO L462 AbstractCegarLoop]: Abstraction has 72662 states and 410462 transitions. [2019-12-27 19:25:38,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 72662 states and 410462 transitions. [2019-12-27 19:25:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:25:38,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:38,123 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:38,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:38,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1544155962, now seen corresponding path program 1 times [2019-12-27 19:25:38,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:38,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769047142] [2019-12-27 19:25:38,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:25:38,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769047142] [2019-12-27 19:25:38,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:38,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:38,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107775246] [2019-12-27 19:25:38,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:38,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:38,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:25:38,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:38,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:38,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:38,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:38,191 INFO L87 Difference]: Start difference. First operand 72662 states and 410462 transitions. Second operand 5 states. [2019-12-27 19:25:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:42,473 INFO L93 Difference]: Finished difference Result 87146 states and 490768 transitions. [2019-12-27 19:25:42,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:42,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-27 19:25:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:42,849 INFO L225 Difference]: With dead ends: 87146 [2019-12-27 19:25:42,849 INFO L226 Difference]: Without dead ends: 87146 [2019-12-27 19:25:42,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87146 states. [2019-12-27 19:25:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87146 to 75561. [2019-12-27 19:25:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75561 states. [2019-12-27 19:25:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75561 states to 75561 states and 426384 transitions. [2019-12-27 19:25:46,298 INFO L78 Accepts]: Start accepts. Automaton has 75561 states and 426384 transitions. Word has length 10 [2019-12-27 19:25:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:46,299 INFO L462 AbstractCegarLoop]: Abstraction has 75561 states and 426384 transitions. [2019-12-27 19:25:46,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75561 states and 426384 transitions. [2019-12-27 19:25:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:25:46,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:46,300 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:46,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2124830999, now seen corresponding path program 1 times [2019-12-27 19:25:46,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:46,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229418679] [2019-12-27 19:25:46,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:25:46,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229418679] [2019-12-27 19:25:46,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:46,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:46,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665619056] [2019-12-27 19:25:46,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:46,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:46,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 13 states and 12 transitions. [2019-12-27 19:25:46,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:46,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:46,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:25:46,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:25:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:46,371 INFO L87 Difference]: Start difference. First operand 75561 states and 426384 transitions. Second operand 4 states. [2019-12-27 19:25:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:51,913 INFO L93 Difference]: Finished difference Result 108084 states and 610107 transitions. [2019-12-27 19:25:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:25:51,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-27 19:25:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:52,389 INFO L225 Difference]: With dead ends: 108084 [2019-12-27 19:25:52,389 INFO L226 Difference]: Without dead ends: 108084 [2019-12-27 19:25:52,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108084 states. [2019-12-27 19:25:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108084 to 95076. [2019-12-27 19:25:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95076 states. [2019-12-27 19:25:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95076 states to 95076 states and 537109 transitions. [2019-12-27 19:25:56,590 INFO L78 Accepts]: Start accepts. Automaton has 95076 states and 537109 transitions. Word has length 12 [2019-12-27 19:25:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:56,590 INFO L462 AbstractCegarLoop]: Abstraction has 95076 states and 537109 transitions. [2019-12-27 19:25:56,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 95076 states and 537109 transitions. [2019-12-27 19:25:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:25:56,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:56,591 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:56,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -566157841, now seen corresponding path program 1 times [2019-12-27 19:25:56,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:56,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432717954] [2019-12-27 19:25:56,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:25:56,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432717954] [2019-12-27 19:25:56,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238429164] [2019-12-27 19:25:56,658 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 19:25:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:56,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 19:25:56,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:25:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:25:56,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:25:56,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2019-12-27 19:25:56,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1354125246] [2019-12-27 19:25:56,766 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:56,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:56,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 35 transitions. [2019-12-27 19:25:56,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:56,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:25:56,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:56,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:25:56,770 INFO L87 Difference]: Start difference. First operand 95076 states and 537109 transitions. Second operand 5 states. [2019-12-27 19:25:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:56,921 INFO L93 Difference]: Finished difference Result 8998 states and 38518 transitions. [2019-12-27 19:25:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:56,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:25:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:56,947 INFO L225 Difference]: With dead ends: 8998 [2019-12-27 19:25:56,948 INFO L226 Difference]: Without dead ends: 8998 [2019-12-27 19:25:56,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:25:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2019-12-27 19:25:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 7375. [2019-12-27 19:25:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-12-27 19:25:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 31180 transitions. [2019-12-27 19:25:57,107 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 31180 transitions. Word has length 13 [2019-12-27 19:25:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:57,107 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 31180 transitions. [2019-12-27 19:25:57,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 31180 transitions. [2019-12-27 19:25:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:25:57,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:57,108 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:57,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:25:57,309 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 877704894, now seen corresponding path program 1 times [2019-12-27 19:25:57,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:57,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960064245] [2019-12-27 19:25:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:25:57,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960064245] [2019-12-27 19:25:57,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:57,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:57,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583258025] [2019-12-27 19:25:57,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:57,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:57,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:25:57,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:57,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:57,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:57,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:57,368 INFO L87 Difference]: Start difference. First operand 7375 states and 31180 transitions. Second operand 5 states. [2019-12-27 19:25:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:57,579 INFO L93 Difference]: Finished difference Result 12733 states and 53782 transitions. [2019-12-27 19:25:57,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:57,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:25:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:57,626 INFO L225 Difference]: With dead ends: 12733 [2019-12-27 19:25:57,626 INFO L226 Difference]: Without dead ends: 12733 [2019-12-27 19:25:57,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12733 states. [2019-12-27 19:25:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12733 to 8239. [2019-12-27 19:25:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8239 states. [2019-12-27 19:25:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 34870 transitions. [2019-12-27 19:25:57,924 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 34870 transitions. Word has length 13 [2019-12-27 19:25:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:57,925 INFO L462 AbstractCegarLoop]: Abstraction has 8239 states and 34870 transitions. [2019-12-27 19:25:57,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 34870 transitions. [2019-12-27 19:25:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:25:57,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:57,928 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:57,928 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1660813028, now seen corresponding path program 1 times [2019-12-27 19:25:57,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:57,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737080781] [2019-12-27 19:25:57,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-27 19:25:57,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737080781] [2019-12-27 19:25:57,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:57,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:57,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [652900066] [2019-12-27 19:25:57,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:57,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:57,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:25:57,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:57,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:57,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:25:57,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:57,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:25:57,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:57,972 INFO L87 Difference]: Start difference. First operand 8239 states and 34870 transitions. Second operand 4 states. [2019-12-27 19:25:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:58,080 INFO L93 Difference]: Finished difference Result 7375 states and 31180 transitions. [2019-12-27 19:25:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:25:58,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 19:25:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:58,107 INFO L225 Difference]: With dead ends: 7375 [2019-12-27 19:25:58,108 INFO L226 Difference]: Without dead ends: 7375 [2019-12-27 19:25:58,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:25:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2019-12-27 19:25:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 6511. [2019-12-27 19:25:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6511 states. [2019-12-27 19:25:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 27490 transitions. [2019-12-27 19:25:58,588 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 27490 transitions. Word has length 15 [2019-12-27 19:25:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:58,589 INFO L462 AbstractCegarLoop]: Abstraction has 6511 states and 27490 transitions. [2019-12-27 19:25:58,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:25:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 27490 transitions. [2019-12-27 19:25:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:25:58,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:58,591 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:58,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1615225847, now seen corresponding path program 1 times [2019-12-27 19:25:58,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:58,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483489115] [2019-12-27 19:25:58,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:25:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-27 19:25:58,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483489115] [2019-12-27 19:25:58,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:25:58,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:25:58,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600610407] [2019-12-27 19:25:58,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:25:58,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:25:58,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:25:58,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:25:58,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:25:58,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:25:58,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:25:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:25:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:58,640 INFO L87 Difference]: Start difference. First operand 6511 states and 27490 transitions. Second operand 5 states. [2019-12-27 19:25:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:25:58,782 INFO L93 Difference]: Finished difference Result 11230 states and 47524 transitions. [2019-12-27 19:25:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:25:58,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:25:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:25:58,823 INFO L225 Difference]: With dead ends: 11230 [2019-12-27 19:25:58,823 INFO L226 Difference]: Without dead ends: 11230 [2019-12-27 19:25:58,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:25:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11230 states. [2019-12-27 19:25:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11230 to 7321. [2019-12-27 19:25:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-12-27 19:25:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 31000 transitions. [2019-12-27 19:25:59,050 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 31000 transitions. Word has length 16 [2019-12-27 19:25:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:25:59,051 INFO L462 AbstractCegarLoop]: Abstraction has 7321 states and 31000 transitions. [2019-12-27 19:25:59,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:25:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 31000 transitions. [2019-12-27 19:25:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:25:59,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:25:59,055 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:25:59,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:25:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:25:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash 501178303, now seen corresponding path program 1 times [2019-12-27 19:25:59,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:25:59,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703077502] [2019-12-27 19:25:59,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:25:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:25:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:25:59,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:25:59,071 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:25:59,071 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:25:59,071 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 19:25:59,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,080 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,080 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,081 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,088 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,105 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,107 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,107 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,107 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,107 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,108 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,109 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,109 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,109 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,109 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,110 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:25:59,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 19:25:59,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:25:59,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:25:59,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:25:59,112 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:25:59,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:25:59,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:25:59,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:25:59,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:25:59,113 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 96 transitions [2019-12-27 19:25:59,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions [2019-12-27 19:25:59,133 INFO L132 PetriNetUnfolder]: 19/149 cut-off events. [2019-12-27 19:25:59,134 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:25:59,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 19/149 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs. 0/117 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 19:25:59,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions [2019-12-27 19:25:59,168 INFO L132 PetriNetUnfolder]: 19/149 cut-off events. [2019-12-27 19:25:59,168 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:25:59,171 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 19/149 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs. 0/117 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-27 19:25:59,182 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-27 19:25:59,182 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:26:00,011 INFO L206 etLargeBlockEncoding]: Checked pairs total: 16552 [2019-12-27 19:26:00,012 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 19:26:00,012 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 57 transitions Received shutdown request... [2019-12-27 19:28:54,382 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:28:54,385 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:28:54,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:28:54 BasicIcfg [2019-12-27 19:28:54,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:28:54,388 INFO L168 Benchmark]: Toolchain (without parser) took 244554.37 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2019-12-27 19:28:54,388 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:28:54,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.10 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 163.6 MB in the end (delta: -61.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:28:54,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 203.4 MB. Free memory was 163.6 MB in the beginning and 161.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 19:28:54,390 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 203.4 MB. Free memory was 161.5 MB in the beginning and 159.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:28:54,390 INFO L168 Benchmark]: RCFGBuilder took 356.65 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 143.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:28:54,391 INFO L168 Benchmark]: TraceAbstraction took 243408.86 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 143.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. [2019-12-27 19:28:54,394 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.17 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.10 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 163.6 MB in the end (delta: -61.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 203.4 MB. Free memory was 163.6 MB in the beginning and 161.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 25.24 ms. Allocated memory is still 203.4 MB. Free memory was 161.5 MB in the beginning and 159.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.65 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 143.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243408.86 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 143.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 31 ProgramPointsBefore, 10 ProgramPointsAfterwards, 31 TransitionsBefore, 10 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 169 CheckedPairsTotal, 27 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.5s, 44 ProgramPointsBefore, 20 ProgramPointsAfterwards, 44 TransitionsBefore, 21 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 389 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1527 CheckedPairsTotal, 28 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.5s, 57 ProgramPointsBefore, 27 ProgramPointsAfterwards, 57 TransitionsBefore, 29 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 768 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3846 CheckedPairsTotal, 37 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 70 ProgramPointsBefore, 36 ProgramPointsAfterwards, 70 TransitionsBefore, 39 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 1273 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6703 CheckedPairsTotal, 43 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 83 ProgramPointsBefore, 43 ProgramPointsAfterwards, 83 TransitionsBefore, 47 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 1865 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 9864 CheckedPairsTotal, 53 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 96 ProgramPointsBefore, 52 ProgramPointsAfterwards, 96 TransitionsBefore, 57 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 2749 VarBasedMoverChecksPositive, 64 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 16552 CheckedPairsTotal, 57 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 687). Cancelled while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 52 places, 57 transitions. Already constructed 282434 states. Currently 57040 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Result: TIMEOUT, OverallTime: 175.2s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown