/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/safe024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:27:08,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:27:08,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:27:08,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:27:08,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:27:08,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:27:08,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:27:08,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:27:08,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:27:08,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:27:08,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:27:08,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:27:08,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:27:08,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:27:08,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:27:08,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:27:08,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:27:08,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:27:08,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:27:08,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:27:08,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:27:08,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:27:08,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:27:08,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:27:08,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:27:08,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:27:08,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:27:08,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:27:08,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:27:08,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:27:08,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:27:08,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:27:08,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:27:08,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:27:08,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:27:08,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:27:08,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:27:08,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:27:08,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:27:08,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:27:08,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:27:08,571 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:27:08,597 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:27:08,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:27:08,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:27:08,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:27:08,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:27:08,601 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:27:08,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:27:08,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:27:08,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:27:08,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:27:08,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:27:08,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:27:08,603 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:27:08,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:27:08,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:27:08,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:27:08,855 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:27:08,856 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:27:08,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2021-03-11 20:27:08,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c954e0778/505aa3ef09344c2c8ecf143e3e05ac94/FLAG2bbe860a9 [2021-03-11 20:27:09,279 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:27:09,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.opt.i [2021-03-11 20:27:09,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c954e0778/505aa3ef09344c2c8ecf143e3e05ac94/FLAG2bbe860a9 [2021-03-11 20:27:09,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c954e0778/505aa3ef09344c2c8ecf143e3e05ac94 [2021-03-11 20:27:09,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:27:09,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:27:09,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:27:09,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:27:09,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:27:09,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:27:09" (1/1) ... [2021-03-11 20:27:09,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cafc8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:09, skipping insertion in model container [2021-03-11 20:27:09,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:27:09" (1/1) ... [2021-03-11 20:27:09,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:27:09,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:27:09,786 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/safe024_power.opt.i[994,1007] [2021-03-11 20:27:09,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:27:09,948 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:27:09,955 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/safe024_power.opt.i[994,1007] [2021-03-11 20:27:09,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:27:10,025 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:27:10,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10 WrapperNode [2021-03-11 20:27:10,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:27:10,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:27:10,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:27:10,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:27:10,031 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:27:10" (1/1) ... [2021-03-11 20:27:10,041 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:27:10" (1/1) ... [2021-03-11 20:27:10,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:27:10,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:27:10,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:27:10,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:27:10,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (1/1) ... [2021-03-11 20:27:10,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:27:10,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:27:10,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:27:10,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:27:10,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (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:27:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:27:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:27:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:27:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:27:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:27:10,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:27:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:27:10,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:27:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:27:10,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:27:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:27:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:27:10,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:27:10,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:27:10,131 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:27:11,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:27:11,299 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:27:11,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:27:11 BoogieIcfgContainer [2021-03-11 20:27:11,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:27:11,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:27:11,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:27:11,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:27:11,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:27:09" (1/3) ... [2021-03-11 20:27:11,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6570374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:27:11, skipping insertion in model container [2021-03-11 20:27:11,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:27:10" (2/3) ... [2021-03-11 20:27:11,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6570374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:27:11, skipping insertion in model container [2021-03-11 20:27:11,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:27:11" (3/3) ... [2021-03-11 20:27:11,306 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2021-03-11 20:27:11,310 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:27:11,313 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:27:11,313 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:27:11,339 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:27:11,374 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:27:11,385 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:27:11,397 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:27:11,397 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:27:11,397 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:27:11,397 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:27:11,397 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:27:11,397 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:27:11,397 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:27:11,397 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:27:11,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:27:11,426 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:27:11,426 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:11,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:27:11,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:27:11,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-11 20:27:11,433 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:27:11,438 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:27:11,440 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:27:11,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-11 20:27:11,451 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:27:11,452 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:11,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:27:11,453 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-11 20:27:13,287 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:27:13,641 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-03-11 20:27:13,747 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:27:15,233 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-11 20:27:15,379 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:27:15,664 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-11 20:27:15,812 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:27:15,817 INFO L131 LiptonReduction]: Checked pairs total: 3847 [2021-03-11 20:27:15,817 INFO L133 LiptonReduction]: Total number of compositions: 85 [2021-03-11 20:27:15,818 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4387 [2021-03-11 20:27:15,823 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-11 20:27:15,823 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:15,823 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:15,824 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:27:15,824 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:15,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 933489254, now seen corresponding path program 1 times [2021-03-11 20:27:15,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:15,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980129500] [2021-03-11 20:27:15,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:15,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:15,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:16,001 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:27:16,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980129500] [2021-03-11 20:27:16,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:27:16,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147251105] [2021-03-11 20:27:16,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:27:16,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:27:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:27:16,015 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 183 [2021-03-11 20:27:16,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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:27:16,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 183 [2021-03-11 20:27:16,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,064 INFO L129 PetriNetUnfolder]: 29/91 cut-off events. [2021-03-11 20:27:16,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:16,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 91 events. 29/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 362 event pairs, 5 based on Foata normal form. 11/93 useless extension candidates. Maximal degree in co-relation 145. Up to 41 conditions per place. [2021-03-11 20:27:16,065 INFO L132 encePairwiseOnDemand]: 179/183 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-11 20:27:16,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2021-03-11 20:27:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:27:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:27:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2021-03-11 20:27:16,074 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8688524590163934 [2021-03-11 20:27:16,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2021-03-11 20:27:16,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2021-03-11 20:27:16,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2021-03-11 20:27:16,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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:27:16,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:27:16,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:27:16,085 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 477 transitions. [2021-03-11 20:27:16,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2021-03-11 20:27:16,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:27:16,088 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2021-03-11 20:27:16,089 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-11 20:27:16,090 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:27:16,090 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-11 20:27:16,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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:27:16,090 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,090 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:16,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:27:16,090 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1735963108, now seen corresponding path program 1 times [2021-03-11 20:27:16,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222541937] [2021-03-11 20:27:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,191 INFO L142 QuantifierPusher]: treesize reduction 13, result has 50.0 percent of original size [2021-03-11 20:27:16,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:16,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,199 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:27:16,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222541937] [2021-03-11 20:27:16,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:27:16,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090953290] [2021-03-11 20:27:16,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:27:16,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:27:16,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:27:16,202 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2021-03-11 20:27:16,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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:27:16,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2021-03-11 20:27:16,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,255 INFO L129 PetriNetUnfolder]: 26/81 cut-off events. [2021-03-11 20:27:16,255 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:27:16,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 81 events. 26/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 270 event pairs, 7 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 137. Up to 28 conditions per place. [2021-03-11 20:27:16,257 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 5 selfloop transitions, 3 changer transitions 9/32 dead transitions. [2021-03-11 20:27:16,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 108 flow [2021-03-11 20:27:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2021-03-11 20:27:16,260 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2021-03-11 20:27:16,260 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2021-03-11 20:27:16,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2021-03-11 20:27:16,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2021-03-11 20:27:16,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 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:27:16,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:16,265 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:16,265 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 744 transitions. [2021-03-11 20:27:16,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 108 flow [2021-03-11 20:27:16,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:16,266 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 75 flow [2021-03-11 20:27:16,266 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-03-11 20:27:16,267 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2021-03-11 20:27:16,267 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 75 flow [2021-03-11 20:27:16,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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:27:16,267 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,269 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:16,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:27:16,269 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2019720817, now seen corresponding path program 1 times [2021-03-11 20:27:16,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171715388] [2021-03-11 20:27:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,350 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:27:16,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171715388] [2021-03-11 20:27:16,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:27:16,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063646595] [2021-03-11 20:27:16,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:16,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:16,354 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183 [2021-03-11 20:27:16,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 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:27:16,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183 [2021-03-11 20:27:16,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,393 INFO L129 PetriNetUnfolder]: 10/61 cut-off events. [2021-03-11 20:27:16,393 INFO L130 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2021-03-11 20:27:16,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 61 events. 10/61 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 205 event pairs, 0 based on Foata normal form. 7/67 useless extension candidates. Maximal degree in co-relation 123. Up to 22 conditions per place. [2021-03-11 20:27:16,395 INFO L132 encePairwiseOnDemand]: 178/183 looper letters, 2 selfloop transitions, 4 changer transitions 7/30 dead transitions. [2021-03-11 20:27:16,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 134 flow [2021-03-11 20:27:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1022 transitions. [2021-03-11 20:27:16,397 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7978142076502732 [2021-03-11 20:27:16,397 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1022 transitions. [2021-03-11 20:27:16,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1022 transitions. [2021-03-11 20:27:16,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1022 transitions. [2021-03-11 20:27:16,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 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:27:16,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,401 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,401 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 75 flow. Second operand 7 states and 1022 transitions. [2021-03-11 20:27:16,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 134 flow [2021-03-11 20:27:16,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 120 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:16,403 INFO L241 Difference]: Finished difference. Result has 42 places, 23 transitions, 91 flow [2021-03-11 20:27:16,403 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2021-03-11 20:27:16,403 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2021-03-11 20:27:16,403 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 91 flow [2021-03-11 20:27:16,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 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:27:16,404 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,404 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:16,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:27:16,404 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 364739539, now seen corresponding path program 1 times [2021-03-11 20:27:16,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895041493] [2021-03-11 20:27:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:16,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:16,477 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:27:16,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895041493] [2021-03-11 20:27:16,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:27:16,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572688628] [2021-03-11 20:27:16,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:27:16,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:27:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:27:16,479 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2021-03-11 20:27:16,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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:27:16,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2021-03-11 20:27:16,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,523 INFO L129 PetriNetUnfolder]: 41/115 cut-off events. [2021-03-11 20:27:16,523 INFO L130 PetriNetUnfolder]: For 100/107 co-relation queries the response was YES. [2021-03-11 20:27:16,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 115 events. 41/115 cut-off events. For 100/107 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 483 event pairs, 14 based on Foata normal form. 10/116 useless extension candidates. Maximal degree in co-relation 281. Up to 56 conditions per place. [2021-03-11 20:27:16,525 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-03-11 20:27:16,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 143 flow [2021-03-11 20:27:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-11 20:27:16,526 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8120218579234972 [2021-03-11 20:27:16,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-11 20:27:16,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-11 20:27:16,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-11 20:27:16,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 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:27:16,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:16,530 INFO L185 Difference]: Start difference. First operand has 42 places, 23 transitions, 91 flow. Second operand 5 states and 743 transitions. [2021-03-11 20:27:16,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 143 flow [2021-03-11 20:27:16,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 132 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-11 20:27:16,533 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 134 flow [2021-03-11 20:27:16,533 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-11 20:27:16,533 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2021-03-11 20:27:16,533 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 134 flow [2021-03-11 20:27:16,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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:27:16,534 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,534 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:27:16,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:27:16,534 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1429369022, now seen corresponding path program 1 times [2021-03-11 20:27:16,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323945767] [2021-03-11 20:27:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:16,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:16,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:16,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:16,592 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:27:16,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323945767] [2021-03-11 20:27:16,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:16,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721906607] [2021-03-11 20:27:16,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:16,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:16,594 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2021-03-11 20:27:16,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 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:27:16,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2021-03-11 20:27:16,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,642 INFO L129 PetriNetUnfolder]: 25/89 cut-off events. [2021-03-11 20:27:16,643 INFO L130 PetriNetUnfolder]: For 109/208 co-relation queries the response was YES. [2021-03-11 20:27:16,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 89 events. 25/89 cut-off events. For 109/208 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 330 event pairs, 2 based on Foata normal form. 31/116 useless extension candidates. Maximal degree in co-relation 292. Up to 52 conditions per place. [2021-03-11 20:27:16,643 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 5 selfloop transitions, 13 changer transitions 4/39 dead transitions. [2021-03-11 20:27:16,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 236 flow [2021-03-11 20:27:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1039 transitions. [2021-03-11 20:27:16,645 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8110850897736144 [2021-03-11 20:27:16,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1039 transitions. [2021-03-11 20:27:16,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1039 transitions. [2021-03-11 20:27:16,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1039 transitions. [2021-03-11 20:27:16,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.42857142857142) internal successors, (1039), 7 states have internal predecessors, (1039), 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:27:16,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,649 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 134 flow. Second operand 7 states and 1039 transitions. [2021-03-11 20:27:16,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 236 flow [2021-03-11 20:27:16,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:16,652 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 214 flow [2021-03-11 20:27:16,652 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-11 20:27:16,652 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2021-03-11 20:27:16,652 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 214 flow [2021-03-11 20:27:16,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 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:27:16,653 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,653 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:27:16,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:27:16,653 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1279159501, now seen corresponding path program 1 times [2021-03-11 20:27:16,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533541670] [2021-03-11 20:27:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:16,753 INFO L142 QuantifierPusher]: treesize reduction 9, result has 64.0 percent of original size [2021-03-11 20:27:16,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:27:16,761 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.7 percent of original size [2021-03-11 20:27:16,762 INFO L147 QuantifierPusher]: treesize reduction 9, result has 78.0 percent of original size 32 [2021-03-11 20:27:16,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:16,786 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:27:16,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533541670] [2021-03-11 20:27:16,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:16,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:16,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626745525] [2021-03-11 20:27:16,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:16,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:16,790 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 183 [2021-03-11 20:27:16,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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:27:16,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:16,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 183 [2021-03-11 20:27:16,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:16,889 INFO L129 PetriNetUnfolder]: 52/187 cut-off events. [2021-03-11 20:27:16,890 INFO L130 PetriNetUnfolder]: For 534/711 co-relation queries the response was YES. [2021-03-11 20:27:16,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 187 events. 52/187 cut-off events. For 534/711 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 994 event pairs, 4 based on Foata normal form. 17/195 useless extension candidates. Maximal degree in co-relation 711. Up to 99 conditions per place. [2021-03-11 20:27:16,891 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 8 selfloop transitions, 7 changer transitions 8/49 dead transitions. [2021-03-11 20:27:16,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 328 flow [2021-03-11 20:27:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2021-03-11 20:27:16,895 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.73224043715847 [2021-03-11 20:27:16,895 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2021-03-11 20:27:16,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2021-03-11 20:27:16,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:16,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2021-03-11 20:27:16,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 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:27:16,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,899 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:16,899 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 214 flow. Second operand 7 states and 938 transitions. [2021-03-11 20:27:16,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 328 flow [2021-03-11 20:27:16,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 298 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:16,902 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 252 flow [2021-03-11 20:27:16,903 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-11 20:27:16,903 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2021-03-11 20:27:16,903 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 252 flow [2021-03-11 20:27:16,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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:27:16,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:16,903 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:27:16,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:27:16,903 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:16,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2064843929, now seen corresponding path program 2 times [2021-03-11 20:27:16,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:16,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488326721] [2021-03-11 20:27:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:16,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:16,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:16,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:27:16,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:16,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:27:17,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:17,002 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:27:17,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488326721] [2021-03-11 20:27:17,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:17,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:27:17,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674275898] [2021-03-11 20:27:17,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:27:17,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:17,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:27:17,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:27:17,004 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2021-03-11 20:27:17,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 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:27:17,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:17,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2021-03-11 20:27:17,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:17,059 INFO L129 PetriNetUnfolder]: 20/100 cut-off events. [2021-03-11 20:27:17,059 INFO L130 PetriNetUnfolder]: For 457/652 co-relation queries the response was YES. [2021-03-11 20:27:17,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 100 events. 20/100 cut-off events. For 457/652 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 453 event pairs, 0 based on Foata normal form. 88/184 useless extension candidates. Maximal degree in co-relation 376. Up to 33 conditions per place. [2021-03-11 20:27:17,061 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 2 selfloop transitions, 17 changer transitions 3/44 dead transitions. [2021-03-11 20:27:17,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 44 transitions, 315 flow [2021-03-11 20:27:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:27:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:27:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1329 transitions. [2021-03-11 20:27:17,064 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8069216757741348 [2021-03-11 20:27:17,064 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1329 transitions. [2021-03-11 20:27:17,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1329 transitions. [2021-03-11 20:27:17,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:17,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1329 transitions. [2021-03-11 20:27:17,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.66666666666666) internal successors, (1329), 9 states have internal predecessors, (1329), 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:27:17,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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:27:17,068 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 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:27:17,068 INFO L185 Difference]: Start difference. First operand has 57 places, 41 transitions, 252 flow. Second operand 9 states and 1329 transitions. [2021-03-11 20:27:17,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 44 transitions, 315 flow [2021-03-11 20:27:17,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 44 transitions, 296 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-11 20:27:17,071 INFO L241 Difference]: Finished difference. Result has 60 places, 41 transitions, 276 flow [2021-03-11 20:27:17,071 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2021-03-11 20:27:17,071 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2021-03-11 20:27:17,071 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 276 flow [2021-03-11 20:27:17,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 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:27:17,072 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:17,072 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] [2021-03-11 20:27:17,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:27:17,072 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:17,072 INFO L82 PathProgramCache]: Analyzing trace with hash -114034914, now seen corresponding path program 1 times [2021-03-11 20:27:17,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:17,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075898765] [2021-03-11 20:27:17,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:17,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:17,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:17,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,195 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:27:17,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075898765] [2021-03-11 20:27:17,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:17,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:17,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802341464] [2021-03-11 20:27:17,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:17,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:17,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:17,197 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 183 [2021-03-11 20:27:17,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 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:27:17,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:17,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 183 [2021-03-11 20:27:17,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:17,240 INFO L129 PetriNetUnfolder]: 32/153 cut-off events. [2021-03-11 20:27:17,240 INFO L130 PetriNetUnfolder]: For 506/562 co-relation queries the response was YES. [2021-03-11 20:27:17,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 153 events. 32/153 cut-off events. For 506/562 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 846 event pairs, 0 based on Foata normal form. 17/164 useless extension candidates. Maximal degree in co-relation 592. Up to 53 conditions per place. [2021-03-11 20:27:17,242 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 5 selfloop transitions, 8 changer transitions 4/47 dead transitions. [2021-03-11 20:27:17,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 47 transitions, 336 flow [2021-03-11 20:27:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:27:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:27:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2021-03-11 20:27:17,244 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7668488160291439 [2021-03-11 20:27:17,244 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 842 transitions. [2021-03-11 20:27:17,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 842 transitions. [2021-03-11 20:27:17,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:17,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 842 transitions. [2021-03-11 20:27:17,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 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:27:17,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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:27:17,248 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 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:27:17,248 INFO L185 Difference]: Start difference. First operand has 60 places, 41 transitions, 276 flow. Second operand 6 states and 842 transitions. [2021-03-11 20:27:17,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 47 transitions, 336 flow [2021-03-11 20:27:17,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 47 transitions, 278 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-11 20:27:17,252 INFO L241 Difference]: Finished difference. Result has 59 places, 43 transitions, 258 flow [2021-03-11 20:27:17,252 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2021-03-11 20:27:17,252 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2021-03-11 20:27:17,252 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 258 flow [2021-03-11 20:27:17,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 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:27:17,253 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:17,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] [2021-03-11 20:27:17,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:27:17,253 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1987680014, now seen corresponding path program 2 times [2021-03-11 20:27:17,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:17,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122536192] [2021-03-11 20:27:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:17,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:27:17,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,326 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:27:17,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122536192] [2021-03-11 20:27:17,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:17,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:27:17,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469407137] [2021-03-11 20:27:17,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:27:17,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:27:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:27:17,327 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183 [2021-03-11 20:27:17,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:27:17,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:17,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183 [2021-03-11 20:27:17,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:17,364 INFO L129 PetriNetUnfolder]: 37/169 cut-off events. [2021-03-11 20:27:17,364 INFO L130 PetriNetUnfolder]: For 286/311 co-relation queries the response was YES. [2021-03-11 20:27:17,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 169 events. 37/169 cut-off events. For 286/311 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 979 event pairs, 0 based on Foata normal form. 9/173 useless extension candidates. Maximal degree in co-relation 547. Up to 48 conditions per place. [2021-03-11 20:27:17,365 INFO L132 encePairwiseOnDemand]: 179/183 looper letters, 4 selfloop transitions, 1 changer transitions 10/44 dead transitions. [2021-03-11 20:27:17,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 44 transitions, 278 flow [2021-03-11 20:27:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:27:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:27:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2021-03-11 20:27:17,366 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7956284153005464 [2021-03-11 20:27:17,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2021-03-11 20:27:17,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2021-03-11 20:27:17,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:17,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2021-03-11 20:27:17,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 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:27:17,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:17,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:27:17,369 INFO L185 Difference]: Start difference. First operand has 59 places, 43 transitions, 258 flow. Second operand 5 states and 728 transitions. [2021-03-11 20:27:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 44 transitions, 278 flow [2021-03-11 20:27:17,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 44 transitions, 273 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:27:17,373 INFO L241 Difference]: Finished difference. Result has 62 places, 34 transitions, 189 flow [2021-03-11 20:27:17,373 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=62, PETRI_TRANSITIONS=34} [2021-03-11 20:27:17,373 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2021-03-11 20:27:17,373 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 34 transitions, 189 flow [2021-03-11 20:27:17,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:27:17,374 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:17,374 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] [2021-03-11 20:27:17,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:27:17,374 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1882476318, now seen corresponding path program 3 times [2021-03-11 20:27:17,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:17,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56328482] [2021-03-11 20:27:17,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:27:17,461 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 20:27:17,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:27:17,472 INFO L142 QuantifierPusher]: treesize reduction 43, result has 70.5 percent of original size [2021-03-11 20:27:17,477 INFO L147 QuantifierPusher]: treesize reduction 8, result has 92.2 percent of original size 95 [2021-03-11 20:27:17,530 INFO L142 QuantifierPusher]: treesize reduction 35, result has 82.1 percent of original size [2021-03-11 20:27:17,537 INFO L147 QuantifierPusher]: treesize reduction 9, result has 94.4 percent of original size 152 [2021-03-11 20:27:17,596 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-11 20:27:17,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-03-11 20:27:17,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:27:17,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:27:17,645 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:27:17,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56328482] [2021-03-11 20:27:17,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:27:17,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:27:17,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900500151] [2021-03-11 20:27:17,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:27:17,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:27:17,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:27:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:27:17,647 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 183 [2021-03-11 20:27:17,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 34 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 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:27:17,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:27:17,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 183 [2021-03-11 20:27:17,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:27:17,753 INFO L129 PetriNetUnfolder]: 19/96 cut-off events. [2021-03-11 20:27:17,753 INFO L130 PetriNetUnfolder]: For 263/298 co-relation queries the response was YES. [2021-03-11 20:27:17,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 96 events. 19/96 cut-off events. For 263/298 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 1 based on Foata normal form. 20/114 useless extension candidates. Maximal degree in co-relation 307. Up to 38 conditions per place. [2021-03-11 20:27:17,754 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 10 selfloop transitions, 5 changer transitions 5/42 dead transitions. [2021-03-11 20:27:17,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 42 transitions, 287 flow [2021-03-11 20:27:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:27:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:27:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2021-03-11 20:27:17,757 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6807181889149102 [2021-03-11 20:27:17,757 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2021-03-11 20:27:17,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2021-03-11 20:27:17,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:27:17,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2021-03-11 20:27:17,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 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:27:17,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:17,761 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 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:27:17,761 INFO L185 Difference]: Start difference. First operand has 62 places, 34 transitions, 189 flow. Second operand 7 states and 872 transitions. [2021-03-11 20:27:17,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 42 transitions, 287 flow [2021-03-11 20:27:17,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 241 flow, removed 20 selfloop flow, removed 8 redundant places. [2021-03-11 20:27:17,762 INFO L241 Difference]: Finished difference. Result has 59 places, 34 transitions, 187 flow [2021-03-11 20:27:17,763 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=34} [2021-03-11 20:27:17,763 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2021-03-11 20:27:17,763 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 34 transitions, 187 flow [2021-03-11 20:27:17,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 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:27:17,763 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:27:17,763 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] [2021-03-11 20:27:17,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:27:17,763 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:27:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:27:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1388491552, now seen corresponding path program 4 times [2021-03-11 20:27:17,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:27:17,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358356011] [2021-03-11 20:27:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:27:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:27:17,816 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:27:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:27:17,845 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:27:17,872 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:27:17,873 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:27:17,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:27:17,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:27:17 BasicIcfg [2021-03-11 20:27:17,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:27:17,937 INFO L168 Benchmark]: Toolchain (without parser) took 8304.04 ms. Allocated memory was 255.9 MB in the beginning and 522.2 MB in the end (delta: 266.3 MB). Free memory was 234.9 MB in the beginning and 220.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 279.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,938 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:27:17,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.32 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.3 MB in the beginning and 318.9 MB in the end (delta: -84.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.90 ms. Allocated memory is still 358.6 MB. Free memory was 318.2 MB in the beginning and 316.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,938 INFO L168 Benchmark]: Boogie Preprocessor took 18.66 ms. Allocated memory is still 358.6 MB. Free memory was 316.1 MB in the beginning and 314.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,939 INFO L168 Benchmark]: RCFGBuilder took 1226.24 ms. Allocated memory is still 358.6 MB. Free memory was 314.0 MB in the beginning and 327.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,939 INFO L168 Benchmark]: TraceAbstraction took 6635.10 ms. Allocated memory was 358.6 MB in the beginning and 522.2 MB in the end (delta: 163.6 MB). Free memory was 326.8 MB in the beginning and 220.8 MB in the end (delta: 106.0 MB). Peak memory consumption was 269.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:27:17,940 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.08 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 389.32 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.3 MB in the beginning and 318.9 MB in the end (delta: -84.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 28.90 ms. Allocated memory is still 358.6 MB. Free memory was 318.2 MB in the beginning and 316.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.66 ms. Allocated memory is still 358.6 MB. Free memory was 316.1 MB in the beginning and 314.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1226.24 ms. Allocated memory is still 358.6 MB. Free memory was 314.0 MB in the beginning and 327.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 65.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6635.10 ms. Allocated memory was 358.6 MB in the beginning and 522.2 MB in the end (delta: 163.6 MB). Free memory was 326.8 MB in the beginning and 220.8 MB in the end (delta: 106.0 MB). Peak memory consumption was 269.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4377.2ms, 103 PlacesBefore, 33 PlacesAfterwards, 95 TransitionsBefore, 24 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 3847 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2225, positive: 2094, positive conditional: 0, positive unconditional: 2094, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1158, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1158, positive: 1095, positive conditional: 0, positive unconditional: 1095, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 602, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 532, negative conditional: 0, negative unconditional: 532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2225, positive: 972, positive conditional: 0, positive unconditional: 972, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 1158, unknown conditional: 0, unknown unconditional: 1158] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2348; [L834] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2349; [L836] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L837] 0 pthread_t t2350; [L838] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6478.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 710.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4423.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 44 SDslu, 57 SDs, 0 SdLazy, 250 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 209.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 347.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=7, InterpolantAutomatonStates: 61, 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: 31.6ms SsaConstructionTime, 412.2ms SatisfiabilityAnalysisTime, 704.6ms InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...