/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:09:30,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:09:30,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:09:30,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:09:30,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:09:30,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:09:30,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:09:30,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:09:30,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:09:30,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:09:30,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:09:30,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:09:30,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:09:30,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:09:30,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:09:30,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:09:30,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:09:30,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:09:30,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:09:30,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:09:30,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:09:30,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:09:30,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:09:30,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:09:30,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:09:30,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:09:30,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:09:30,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:09:30,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:09:30,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:09:30,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:09:30,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:09:30,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:09:30,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:09:30,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:09:30,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:09:30,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:09:30,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:09:30,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:09:30,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:09:30,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:09:30,644 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-PN-SemanticLbe.epf [2021-03-11 20:09:30,671 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:09:30,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:09:30,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:09:30,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:09:30,674 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:09:30,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:09:30,674 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:09:30,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:09:30,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:09:30,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:09:30,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:09:30,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:09:30,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:09:30,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:09:30,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:09:30,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:09:30,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:09:30,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:09:30,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:09:30,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:09:30,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:09:30,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:09:30,920 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:09:30,920 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:09:30,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2021-03-11 20:09:30,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863f2e5ed/7d896fdf972e487fa55646c88a13f6b1/FLAG8720a4558 [2021-03-11 20:09:31,520 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:09:31,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i [2021-03-11 20:09:31,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863f2e5ed/7d896fdf972e487fa55646c88a13f6b1/FLAG8720a4558 [2021-03-11 20:09:31,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863f2e5ed/7d896fdf972e487fa55646c88a13f6b1 [2021-03-11 20:09:31,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:09:31,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:09:31,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:09:31,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:09:31,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:09:31,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:09:31" (1/1) ... [2021-03-11 20:09:31,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52302109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:31, skipping insertion in model container [2021-03-11 20:09:31,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:09:31" (1/1) ... [2021-03-11 20:09:31,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:09:31,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:09:31,899 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i[950,963] [2021-03-11 20:09:32,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:09:32,072 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:09:32,082 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_power.opt.i[950,963] [2021-03-11 20:09:32,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:09:32,195 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:09:32,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32 WrapperNode [2021-03-11 20:09:32,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:09:32,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:09:32,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:09:32,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:09:32,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:09:32,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:09:32,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:09:32,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:09:32,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (1/1) ... [2021-03-11 20:09:32,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:09:32,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:09:32,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:09:32,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:09:32,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (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 [2021-03-11 20:09:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:09:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:09:32,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:09:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:09:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:09:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:09:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:09:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:09:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:09:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:09:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:09:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:09:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:09:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:09:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:09:32,390 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:09:33,384 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:09:33,384 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:09:33,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:09:33 BoogieIcfgContainer [2021-03-11 20:09:33,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:09:33,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:09:33,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:09:33,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:09:33,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:09:31" (1/3) ... [2021-03-11 20:09:33,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ee457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:09:33, skipping insertion in model container [2021-03-11 20:09:33,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:09:32" (2/3) ... [2021-03-11 20:09:33,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ee457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:09:33, skipping insertion in model container [2021-03-11 20:09:33,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:09:33" (3/3) ... [2021-03-11 20:09:33,393 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_power.opt.i [2021-03-11 20:09:33,397 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:09:33,399 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:09:33,400 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:09:33,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,462 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,463 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,466 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,468 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,469 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,473 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,473 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,477 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:09:33,479 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:09:33,490 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:09:33,512 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:09:33,513 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:09:33,513 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:09:33,513 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:09:33,513 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:09:33,513 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:09:33,513 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:09:33,513 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:09:33,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-11 20:09:33,550 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-11 20:09:33,550 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:09:33,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-11 20:09:33,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-11 20:09:33,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-11 20:09:33,558 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:09:33,564 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-11 20:09:33,565 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-11 20:09:33,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-11 20:09:33,578 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-11 20:09:33,578 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:09:33,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-11 20:09:33,580 INFO L116 LiptonReduction]: Number of co-enabled transitions 2488 [2021-03-11 20:09:34,591 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:09:34,931 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:09:35,043 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:09:37,534 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:09:37,683 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:09:37,975 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-11 20:09:38,121 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-11 20:09:38,133 INFO L131 LiptonReduction]: Checked pairs total: 5819 [2021-03-11 20:09:38,134 INFO L133 LiptonReduction]: Total number of compositions: 95 [2021-03-11 20:09:38,135 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4579 [2021-03-11 20:09:38,141 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-11 20:09:38,141 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:09:38,141 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:38,141 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:38,141 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:38,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1064777143, now seen corresponding path program 1 times [2021-03-11 20:09:38,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:38,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512166810] [2021-03-11 20:09:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:38,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:38,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:38,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512166810] [2021-03-11 20:09:38,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:38,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:09:38,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336415219] [2021-03-11 20:09:38,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:09:38,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:09:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:09:38,340 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 211 [2021-03-11 20:09:38,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:38,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 211 [2021-03-11 20:09:38,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:38,385 INFO L129 PetriNetUnfolder]: 9/59 cut-off events. [2021-03-11 20:09:38,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:09:38,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 59 events. 9/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 157 event pairs, 3 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 83. Up to 17 conditions per place. [2021-03-11 20:09:38,386 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 5 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-11 20:09:38,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 84 flow [2021-03-11 20:09:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:09:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:09:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2021-03-11 20:09:38,396 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8830963665086888 [2021-03-11 20:09:38,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2021-03-11 20:09:38,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2021-03-11 20:09:38,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:38,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2021-03-11 20:09:38,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,414 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 559 transitions. [2021-03-11 20:09:38,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 84 flow [2021-03-11 20:09:38,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 80 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:09:38,418 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 66 flow [2021-03-11 20:09:38,419 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-11 20:09:38,419 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2021-03-11 20:09:38,419 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-11 20:09:38,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,420 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:38,420 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:38,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:09:38,420 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1850238275, now seen corresponding path program 1 times [2021-03-11 20:09:38,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:38,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974378174] [2021-03-11 20:09:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:38,519 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:09:38,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:09:38,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:38,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:38,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974378174] [2021-03-11 20:09:38,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:38,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:09:38,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090937762] [2021-03-11 20:09:38,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:09:38,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:09:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:09:38,535 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 211 [2021-03-11 20:09:38,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:38,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 211 [2021-03-11 20:09:38,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:38,806 INFO L129 PetriNetUnfolder]: 1020/1866 cut-off events. [2021-03-11 20:09:38,806 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:09:38,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 1866 events. 1020/1866 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 12041 event pairs, 284 based on Foata normal form. 0/1746 useless extension candidates. Maximal degree in co-relation 3406. Up to 693 conditions per place. [2021-03-11 20:09:38,817 INFO L132 encePairwiseOnDemand]: 201/211 looper letters, 10 selfloop transitions, 8 changer transitions 19/53 dead transitions. [2021-03-11 20:09:38,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 192 flow [2021-03-11 20:09:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-11 20:09:38,823 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.790521327014218 [2021-03-11 20:09:38,824 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-11 20:09:38,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-11 20:09:38,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:38,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-11 20:09:38,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,828 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 834 transitions. [2021-03-11 20:09:38,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 192 flow [2021-03-11 20:09:38,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:09:38,830 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 140 flow [2021-03-11 20:09:38,830 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-11 20:09:38,830 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2021-03-11 20:09:38,830 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 140 flow [2021-03-11 20:09:38,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:38,831 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:38,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:09:38,833 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:38,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1935747972, now seen corresponding path program 1 times [2021-03-11 20:09:38,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:38,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783692629] [2021-03-11 20:09:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:38,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:38,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:38,891 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:09:38,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:09:38,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:38,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:38,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783692629] [2021-03-11 20:09:38,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:38,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:09:38,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819815254] [2021-03-11 20:09:38,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:09:38,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:38,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:09:38,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:09:38,905 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 211 [2021-03-11 20:09:38,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:38,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:38,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 211 [2021-03-11 20:09:38,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:39,040 INFO L129 PetriNetUnfolder]: 481/1009 cut-off events. [2021-03-11 20:09:39,040 INFO L130 PetriNetUnfolder]: For 740/1278 co-relation queries the response was YES. [2021-03-11 20:09:39,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1009 events. 481/1009 cut-off events. For 740/1278 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6491 event pairs, 96 based on Foata normal form. 83/1069 useless extension candidates. Maximal degree in co-relation 3297. Up to 504 conditions per place. [2021-03-11 20:09:39,045 INFO L132 encePairwiseOnDemand]: 201/211 looper letters, 18 selfloop transitions, 12 changer transitions 26/72 dead transitions. [2021-03-11 20:09:39,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 484 flow [2021-03-11 20:09:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:09:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:09:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1161 transitions. [2021-03-11 20:09:39,048 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7860528097494922 [2021-03-11 20:09:39,048 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1161 transitions. [2021-03-11 20:09:39,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1161 transitions. [2021-03-11 20:09:39,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:39,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1161 transitions. [2021-03-11 20:09:39,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,053 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 140 flow. Second operand 7 states and 1161 transitions. [2021-03-11 20:09:39,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 484 flow [2021-03-11 20:09:39,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:09:39,061 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 240 flow [2021-03-11 20:09:39,061 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-03-11 20:09:39,061 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2021-03-11 20:09:39,061 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 240 flow [2021-03-11 20:09:39,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,062 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:39,062 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:39,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:09:39,062 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1522882252, now seen corresponding path program 1 times [2021-03-11 20:09:39,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:39,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752076650] [2021-03-11 20:09:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:39,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,121 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:09:39,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:09:39,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:39,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752076650] [2021-03-11 20:09:39,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:39,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:09:39,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149740169] [2021-03-11 20:09:39,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:09:39,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:39,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:09:39,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:09:39,134 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 211 [2021-03-11 20:09:39,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:39,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 211 [2021-03-11 20:09:39,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:39,248 INFO L129 PetriNetUnfolder]: 362/774 cut-off events. [2021-03-11 20:09:39,249 INFO L130 PetriNetUnfolder]: For 2233/2967 co-relation queries the response was YES. [2021-03-11 20:09:39,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 774 events. 362/774 cut-off events. For 2233/2967 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4587 event pairs, 31 based on Foata normal form. 62/814 useless extension candidates. Maximal degree in co-relation 3063. Up to 391 conditions per place. [2021-03-11 20:09:39,254 INFO L132 encePairwiseOnDemand]: 201/211 looper letters, 26 selfloop transitions, 15 changer transitions 21/78 dead transitions. [2021-03-11 20:09:39,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 650 flow [2021-03-11 20:09:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:09:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:09:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1154 transitions. [2021-03-11 20:09:39,257 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7813134732566012 [2021-03-11 20:09:39,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1154 transitions. [2021-03-11 20:09:39,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1154 transitions. [2021-03-11 20:09:39,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:39,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1154 transitions. [2021-03-11 20:09:39,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,263 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,263 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 240 flow. Second operand 7 states and 1154 transitions. [2021-03-11 20:09:39,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 650 flow [2021-03-11 20:09:39,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 642 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-11 20:09:39,270 INFO L241 Difference]: Finished difference. Result has 60 places, 50 transitions, 402 flow [2021-03-11 20:09:39,271 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2021-03-11 20:09:39,271 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2021-03-11 20:09:39,271 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 402 flow [2021-03-11 20:09:39,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,271 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:39,271 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:39,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:09:39,271 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1963574801, now seen corresponding path program 1 times [2021-03-11 20:09:39,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:39,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591197099] [2021-03-11 20:09:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:39,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:39,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591197099] [2021-03-11 20:09:39,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:39,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:09:39,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224045294] [2021-03-11 20:09:39,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:09:39,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:09:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:09:39,355 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-11 20:09:39,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:39,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-11 20:09:39,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:39,421 INFO L129 PetriNetUnfolder]: 260/600 cut-off events. [2021-03-11 20:09:39,421 INFO L130 PetriNetUnfolder]: For 2696/3031 co-relation queries the response was YES. [2021-03-11 20:09:39,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 600 events. 260/600 cut-off events. For 2696/3031 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3509 event pairs, 81 based on Foata normal form. 59/646 useless extension candidates. Maximal degree in co-relation 2514. Up to 293 conditions per place. [2021-03-11 20:09:39,425 INFO L132 encePairwiseOnDemand]: 206/211 looper letters, 12 selfloop transitions, 7 changer transitions 7/63 dead transitions. [2021-03-11 20:09:39,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 574 flow [2021-03-11 20:09:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 889 transitions. [2021-03-11 20:09:39,427 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.842654028436019 [2021-03-11 20:09:39,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 889 transitions. [2021-03-11 20:09:39,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 889 transitions. [2021-03-11 20:09:39,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:39,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 889 transitions. [2021-03-11 20:09:39,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,430 INFO L185 Difference]: Start difference. First operand has 60 places, 50 transitions, 402 flow. Second operand 5 states and 889 transitions. [2021-03-11 20:09:39,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 574 flow [2021-03-11 20:09:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 548 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-11 20:09:39,438 INFO L241 Difference]: Finished difference. Result has 60 places, 56 transitions, 477 flow [2021-03-11 20:09:39,438 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=477, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2021-03-11 20:09:39,438 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2021-03-11 20:09:39,438 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 477 flow [2021-03-11 20:09:39,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:39,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:39,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:09:39,439 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash 3273709, now seen corresponding path program 1 times [2021-03-11 20:09:39,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:39,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033744959] [2021-03-11 20:09:39,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:39,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:39,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:39,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033744959] [2021-03-11 20:09:39,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:39,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:09:39,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927990340] [2021-03-11 20:09:39,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:09:39,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:09:39,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:09:39,495 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-11 20:09:39,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:39,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-11 20:09:39,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:39,569 INFO L129 PetriNetUnfolder]: 253/639 cut-off events. [2021-03-11 20:09:39,569 INFO L130 PetriNetUnfolder]: For 3015/3356 co-relation queries the response was YES. [2021-03-11 20:09:39,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 639 events. 253/639 cut-off events. For 3015/3356 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4022 event pairs, 86 based on Foata normal form. 37/663 useless extension candidates. Maximal degree in co-relation 2762. Up to 303 conditions per place. [2021-03-11 20:09:39,574 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 7 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2021-03-11 20:09:39,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 559 flow [2021-03-11 20:09:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 886 transitions. [2021-03-11 20:09:39,576 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8398104265402844 [2021-03-11 20:09:39,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 886 transitions. [2021-03-11 20:09:39,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 886 transitions. [2021-03-11 20:09:39,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:39,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 886 transitions. [2021-03-11 20:09:39,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,579 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,579 INFO L185 Difference]: Start difference. First operand has 60 places, 56 transitions, 477 flow. Second operand 5 states and 886 transitions. [2021-03-11 20:09:39,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 559 flow [2021-03-11 20:09:39,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 532 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-11 20:09:39,585 INFO L241 Difference]: Finished difference. Result has 61 places, 55 transitions, 474 flow [2021-03-11 20:09:39,585 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2021-03-11 20:09:39,585 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2021-03-11 20:09:39,585 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 474 flow [2021-03-11 20:09:39,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,586 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:39,586 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:39,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:09:39,586 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -671438242, now seen corresponding path program 1 times [2021-03-11 20:09:39,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:39,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837493057] [2021-03-11 20:09:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:39,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,616 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:09:39,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:09:39,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:39,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837493057] [2021-03-11 20:09:39,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:39,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:09:39,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278239017] [2021-03-11 20:09:39,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:09:39,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:09:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:09:39,623 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 211 [2021-03-11 20:09:39,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:39,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 211 [2021-03-11 20:09:39,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:39,867 INFO L129 PetriNetUnfolder]: 1270/2500 cut-off events. [2021-03-11 20:09:39,867 INFO L130 PetriNetUnfolder]: For 4236/4467 co-relation queries the response was YES. [2021-03-11 20:09:39,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6997 conditions, 2500 events. 1270/2500 cut-off events. For 4236/4467 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 19712 event pairs, 590 based on Foata normal form. 229/2498 useless extension candidates. Maximal degree in co-relation 6969. Up to 1500 conditions per place. [2021-03-11 20:09:39,886 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-11 20:09:39,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 68 transitions, 540 flow [2021-03-11 20:09:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-03-11 20:09:39,888 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8265402843601896 [2021-03-11 20:09:39,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-03-11 20:09:39,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-03-11 20:09:39,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:39,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-03-11 20:09:39,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,893 INFO L185 Difference]: Start difference. First operand has 61 places, 55 transitions, 474 flow. Second operand 5 states and 872 transitions. [2021-03-11 20:09:39,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 68 transitions, 540 flow [2021-03-11 20:09:39,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 520 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-11 20:09:39,899 INFO L241 Difference]: Finished difference. Result has 62 places, 64 transitions, 529 flow [2021-03-11 20:09:39,899 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=529, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2021-03-11 20:09:39,900 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2021-03-11 20:09:39,900 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 529 flow [2021-03-11 20:09:39,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,900 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:39,900 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:39,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:09:39,900 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 548576449, now seen corresponding path program 1 times [2021-03-11 20:09:39,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:39,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712221587] [2021-03-11 20:09:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:39,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:39,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:39,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:39,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712221587] [2021-03-11 20:09:39,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:39,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:09:39,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055018696] [2021-03-11 20:09:39,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:09:39,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:09:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:09:39,945 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-11 20:09:39,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 529 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:39,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:39,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-11 20:09:39,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:40,282 INFO L129 PetriNetUnfolder]: 1864/3678 cut-off events. [2021-03-11 20:09:40,282 INFO L130 PetriNetUnfolder]: For 6865/8626 co-relation queries the response was YES. [2021-03-11 20:09:40,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 3678 events. 1864/3678 cut-off events. For 6865/8626 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 31260 event pairs, 903 based on Foata normal form. 145/3370 useless extension candidates. Maximal degree in co-relation 12425. Up to 2479 conditions per place. [2021-03-11 20:09:40,307 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 6 selfloop transitions, 16 changer transitions 0/67 dead transitions. [2021-03-11 20:09:40,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 67 transitions, 603 flow [2021-03-11 20:09:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 886 transitions. [2021-03-11 20:09:40,309 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8398104265402844 [2021-03-11 20:09:40,309 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 886 transitions. [2021-03-11 20:09:40,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 886 transitions. [2021-03-11 20:09:40,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:40,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 886 transitions. [2021-03-11 20:09:40,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.2) internal successors, (886), 5 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,312 INFO L185 Difference]: Start difference. First operand has 62 places, 64 transitions, 529 flow. Second operand 5 states and 886 transitions. [2021-03-11 20:09:40,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 67 transitions, 603 flow [2021-03-11 20:09:40,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 594 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-11 20:09:40,327 INFO L241 Difference]: Finished difference. Result has 68 places, 66 transitions, 598 flow [2021-03-11 20:09:40,327 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2021-03-11 20:09:40,327 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2021-03-11 20:09:40,327 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 598 flow [2021-03-11 20:09:40,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,327 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:40,328 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:40,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:09:40,328 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 541047781, now seen corresponding path program 1 times [2021-03-11 20:09:40,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:40,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695901334] [2021-03-11 20:09:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:40,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:40,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:40,375 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:09:40,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:09:40,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:40,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695901334] [2021-03-11 20:09:40,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:40,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:09:40,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847868232] [2021-03-11 20:09:40,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:09:40,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:09:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:09:40,384 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 211 [2021-03-11 20:09:40,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 598 flow. Second operand has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:40,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 211 [2021-03-11 20:09:40,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:40,696 INFO L129 PetriNetUnfolder]: 1330/2885 cut-off events. [2021-03-11 20:09:40,696 INFO L130 PetriNetUnfolder]: For 6859/11917 co-relation queries the response was YES. [2021-03-11 20:09:40,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11754 conditions, 2885 events. 1330/2885 cut-off events. For 6859/11917 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 25110 event pairs, 249 based on Foata normal form. 971/3622 useless extension candidates. Maximal degree in co-relation 11722. Up to 2114 conditions per place. [2021-03-11 20:09:40,719 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2021-03-11 20:09:40,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 732 flow [2021-03-11 20:09:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:09:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:09:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2021-03-11 20:09:40,721 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8266756939742722 [2021-03-11 20:09:40,721 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1221 transitions. [2021-03-11 20:09:40,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1221 transitions. [2021-03-11 20:09:40,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:40,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1221 transitions. [2021-03-11 20:09:40,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.42857142857142) internal successors, (1221), 7 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,726 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,726 INFO L185 Difference]: Start difference. First operand has 68 places, 66 transitions, 598 flow. Second operand 7 states and 1221 transitions. [2021-03-11 20:09:40,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 732 flow [2021-03-11 20:09:40,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 710 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-11 20:09:40,743 INFO L241 Difference]: Finished difference. Result has 76 places, 75 transitions, 710 flow [2021-03-11 20:09:40,743 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=710, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2021-03-11 20:09:40,743 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2021-03-11 20:09:40,743 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 710 flow [2021-03-11 20:09:40,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,744 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:40,744 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:40,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:09:40,744 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash 589583117, now seen corresponding path program 1 times [2021-03-11 20:09:40,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:40,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15204025] [2021-03-11 20:09:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:40,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:40,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:40,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:40,835 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:09:40,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:09:40,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:40,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:40,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15204025] [2021-03-11 20:09:40,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:40,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:09:40,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120681332] [2021-03-11 20:09:40,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:09:40,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:09:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:09:40,843 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 211 [2021-03-11 20:09:40,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:40,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:40,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 211 [2021-03-11 20:09:40,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:41,126 INFO L129 PetriNetUnfolder]: 1057/2397 cut-off events. [2021-03-11 20:09:41,126 INFO L130 PetriNetUnfolder]: For 12669/27262 co-relation queries the response was YES. [2021-03-11 20:09:41,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13276 conditions, 2397 events. 1057/2397 cut-off events. For 12669/27262 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 20888 event pairs, 46 based on Foata normal form. 1408/3602 useless extension candidates. Maximal degree in co-relation 13240. Up to 1914 conditions per place. [2021-03-11 20:09:41,147 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 28 changer transitions 7/88 dead transitions. [2021-03-11 20:09:41,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 88 transitions, 912 flow [2021-03-11 20:09:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:09:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:09:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1570 transitions. [2021-03-11 20:09:41,150 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8267509215376514 [2021-03-11 20:09:41,150 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1570 transitions. [2021-03-11 20:09:41,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1570 transitions. [2021-03-11 20:09:41,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:41,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1570 transitions. [2021-03-11 20:09:41,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 174.44444444444446) internal successors, (1570), 9 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,200 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,200 INFO L185 Difference]: Start difference. First operand has 76 places, 75 transitions, 710 flow. Second operand 9 states and 1570 transitions. [2021-03-11 20:09:41,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 88 transitions, 912 flow [2021-03-11 20:09:41,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 88 transitions, 860 flow, removed 18 selfloop flow, removed 3 redundant places. [2021-03-11 20:09:41,251 INFO L241 Difference]: Finished difference. Result has 84 places, 81 transitions, 802 flow [2021-03-11 20:09:41,252 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=802, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2021-03-11 20:09:41,252 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2021-03-11 20:09:41,252 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 802 flow [2021-03-11 20:09:41,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,253 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:41,253 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:41,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:09:41,253 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash 48223777, now seen corresponding path program 1 times [2021-03-11 20:09:41,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:41,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462394565] [2021-03-11 20:09:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:41,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,326 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:09:41,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:09:41,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:41,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462394565] [2021-03-11 20:09:41,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:41,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:09:41,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922804562] [2021-03-11 20:09:41,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:09:41,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:09:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:09:41,337 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 211 [2021-03-11 20:09:41,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 802 flow. Second operand has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:41,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 211 [2021-03-11 20:09:41,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:41,618 INFO L129 PetriNetUnfolder]: 911/2106 cut-off events. [2021-03-11 20:09:41,618 INFO L130 PetriNetUnfolder]: For 14476/21553 co-relation queries the response was YES. [2021-03-11 20:09:41,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 2106 events. 911/2106 cut-off events. For 14476/21553 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 18491 event pairs, 23 based on Foata normal form. 1104/3011 useless extension candidates. Maximal degree in co-relation 12350. Up to 1162 conditions per place. [2021-03-11 20:09:41,633 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 2 selfloop transitions, 33 changer transitions 20/86 dead transitions. [2021-03-11 20:09:41,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 936 flow [2021-03-11 20:09:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:09:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:09:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1911 transitions. [2021-03-11 20:09:41,636 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8233520034467902 [2021-03-11 20:09:41,636 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1911 transitions. [2021-03-11 20:09:41,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1911 transitions. [2021-03-11 20:09:41,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:41,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1911 transitions. [2021-03-11 20:09:41,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 173.72727272727272) internal successors, (1911), 11 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,642 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,642 INFO L185 Difference]: Start difference. First operand has 84 places, 81 transitions, 802 flow. Second operand 11 states and 1911 transitions. [2021-03-11 20:09:41,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 936 flow [2021-03-11 20:09:41,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 810 flow, removed 43 selfloop flow, removed 10 redundant places. [2021-03-11 20:09:41,769 INFO L241 Difference]: Finished difference. Result has 85 places, 66 transitions, 580 flow [2021-03-11 20:09:41,769 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=580, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2021-03-11 20:09:41,770 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2021-03-11 20:09:41,770 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 580 flow [2021-03-11 20:09:41,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,770 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:41,770 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:41,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:09:41,770 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -539660951, now seen corresponding path program 1 times [2021-03-11 20:09:41,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:41,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002544592] [2021-03-11 20:09:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:41,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:41,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,831 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:09:41,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:09:41,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:41,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:41,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002544592] [2021-03-11 20:09:41,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:41,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:09:41,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401434992] [2021-03-11 20:09:41,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:09:41,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:09:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:09:41,845 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 211 [2021-03-11 20:09:41,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:41,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 211 [2021-03-11 20:09:41,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:41,926 INFO L129 PetriNetUnfolder]: 271/671 cut-off events. [2021-03-11 20:09:41,926 INFO L130 PetriNetUnfolder]: For 2135/2420 co-relation queries the response was YES. [2021-03-11 20:09:41,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 671 events. 271/671 cut-off events. For 2135/2420 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4648 event pairs, 5 based on Foata normal form. 8/622 useless extension candidates. Maximal degree in co-relation 2944. Up to 185 conditions per place. [2021-03-11 20:09:41,930 INFO L132 encePairwiseOnDemand]: 200/211 looper letters, 13 selfloop transitions, 19 changer transitions 3/78 dead transitions. [2021-03-11 20:09:41,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 78 transitions, 747 flow [2021-03-11 20:09:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:09:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:09:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2021-03-11 20:09:41,932 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7543443917851501 [2021-03-11 20:09:41,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 955 transitions. [2021-03-11 20:09:41,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 955 transitions. [2021-03-11 20:09:41,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:41,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 955 transitions. [2021-03-11 20:09:41,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.16666666666666) internal successors, (955), 6 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,945 INFO L185 Difference]: Start difference. First operand has 85 places, 66 transitions, 580 flow. Second operand 6 states and 955 transitions. [2021-03-11 20:09:41,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 78 transitions, 747 flow [2021-03-11 20:09:41,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 567 flow, removed 44 selfloop flow, removed 16 redundant places. [2021-03-11 20:09:41,959 INFO L241 Difference]: Finished difference. Result has 76 places, 75 transitions, 573 flow [2021-03-11 20:09:41,960 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2021-03-11 20:09:41,960 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2021-03-11 20:09:41,960 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 573 flow [2021-03-11 20:09:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:41,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:41,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:41,960 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:09:41,960 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2058699749, now seen corresponding path program 2 times [2021-03-11 20:09:41,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:41,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825903909] [2021-03-11 20:09:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:09:42,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:42,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:09:42,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:42,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:42,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:42,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:42,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:09:42,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:09:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:09:42,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825903909] [2021-03-11 20:09:42,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:09:42,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:09:42,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135599533] [2021-03-11 20:09:42,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:09:42,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:09:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:09:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:09:42,017 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 211 [2021-03-11 20:09:42,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 573 flow. Second operand has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:42,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:09:42,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 211 [2021-03-11 20:09:42,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:09:42,093 INFO L129 PetriNetUnfolder]: 348/852 cut-off events. [2021-03-11 20:09:42,093 INFO L130 PetriNetUnfolder]: For 1482/1584 co-relation queries the response was YES. [2021-03-11 20:09:42,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 852 events. 348/852 cut-off events. For 1482/1584 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 6357 event pairs, 5 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 3071. Up to 235 conditions per place. [2021-03-11 20:09:42,097 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 4 selfloop transitions, 1 changer transitions 22/76 dead transitions. [2021-03-11 20:09:42,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 597 flow [2021-03-11 20:09:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:09:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:09:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2021-03-11 20:09:42,099 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8274881516587678 [2021-03-11 20:09:42,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2021-03-11 20:09:42,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2021-03-11 20:09:42,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:09:42,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2021-03-11 20:09:42,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:42,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:42,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:42,102 INFO L185 Difference]: Start difference. First operand has 76 places, 75 transitions, 573 flow. Second operand 5 states and 873 transitions. [2021-03-11 20:09:42,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 597 flow [2021-03-11 20:09:42,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 593 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-11 20:09:42,116 INFO L241 Difference]: Finished difference. Result has 80 places, 54 transitions, 371 flow [2021-03-11 20:09:42,116 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=371, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2021-03-11 20:09:42,116 INFO L335 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2021-03-11 20:09:42,116 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 371 flow [2021-03-11 20:09:42,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:09:42,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:09:42,117 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:09:42,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:09:42,117 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:09:42,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:09:42,117 INFO L82 PathProgramCache]: Analyzing trace with hash -930922857, now seen corresponding path program 3 times [2021-03-11 20:09:42,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:09:42,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167550689] [2021-03-11 20:09:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:09:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:09:42,157 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:09:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:09:42,181 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:09:42,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:09:42,210 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:09:42,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:09:42,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:09:42 BasicIcfg [2021-03-11 20:09:42,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:09:42,286 INFO L168 Benchmark]: Toolchain (without parser) took 10531.91 ms. Allocated memory was 255.9 MB in the beginning and 620.8 MB in the end (delta: 364.9 MB). Free memory was 234.6 MB in the beginning and 514.7 MB in the end (delta: -280.2 MB). Peak memory consumption was 84.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,286 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:09:42,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.24 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.0 MB in the beginning and 314.6 MB in the end (delta: -80.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.42 ms. Allocated memory is still 354.4 MB. Free memory was 314.6 MB in the beginning and 311.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,288 INFO L168 Benchmark]: Boogie Preprocessor took 47.20 ms. Allocated memory is still 354.4 MB. Free memory was 311.7 MB in the beginning and 309.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,288 INFO L168 Benchmark]: RCFGBuilder took 1084.17 ms. Allocated memory is still 354.4 MB. Free memory was 309.7 MB in the beginning and 257.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,288 INFO L168 Benchmark]: TraceAbstraction took 8897.92 ms. Allocated memory was 354.4 MB in the beginning and 620.8 MB in the end (delta: 266.3 MB). Free memory was 256.2 MB in the beginning and 514.7 MB in the end (delta: -258.6 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:09:42,295 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 439.24 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.0 MB in the beginning and 314.6 MB in the end (delta: -80.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.42 ms. Allocated memory is still 354.4 MB. Free memory was 314.6 MB in the beginning and 311.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.20 ms. Allocated memory is still 354.4 MB. Free memory was 311.7 MB in the beginning and 309.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1084.17 ms. Allocated memory is still 354.4 MB. Free memory was 309.7 MB in the beginning and 257.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8897.92 ms. Allocated memory was 354.4 MB in the beginning and 620.8 MB in the end (delta: 266.3 MB). Free memory was 256.2 MB in the beginning and 514.7 MB in the end (delta: -258.6 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4568.6ms, 123 PlacesBefore, 41 PlacesAfterwards, 112 TransitionsBefore, 29 TransitionsAfterwards, 2488 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 5819 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2960, positive: 2802, positive conditional: 0, positive unconditional: 2802, negative: 158, negative conditional: 0, negative unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1786, positive: 1728, positive conditional: 0, positive unconditional: 1728, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1786, positive: 1696, positive conditional: 0, positive unconditional: 1696, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 446, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 379, negative conditional: 0, negative unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2960, positive: 1074, positive conditional: 0, positive unconditional: 1074, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 1786, unknown conditional: 0, unknown unconditional: 1786] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L867] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8701.7ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2957.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4625.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 100 SDslu, 130 SDs, 0 SdLazy, 284 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 259.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 252.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=802occurred in iteration=10, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.5ms SsaConstructionTime, 323.5ms SatisfiabilityAnalysisTime, 529.2ms InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...