/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:12:26,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:12:26,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:12:26,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:12:26,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:12:26,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:12:26,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:12:26,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:12:26,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:12:26,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:12:26,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:12:26,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:12:26,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:12:26,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:12:26,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:12:26,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:12:26,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:12:26,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:12:26,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:12:26,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:12:26,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:12:26,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:12:26,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:12:26,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:12:26,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:12:26,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:12:26,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:12:26,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:12:26,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:12:26,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:12:26,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:12:26,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:12:26,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:12:26,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:12:26,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:12:26,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:12:26,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:12:26,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:12:26,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:12:26,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:12:26,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:12:26,275 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:12:26,300 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:12:26,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:12:26,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:12:26,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:12:26,303 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:12:26,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:12:26,304 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:12:26,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:12:26,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:12:26,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:12:26,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:12:26,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:12:26,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:12:26,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:12:26,306 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:12:26,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:12:26,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:12:26,307 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-26 00:12:26,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:12:26,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:12:26,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:12:26,592 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:12:26,593 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:12:26,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2021-03-26 00:12:26,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae0095e1/8b51495c3fbf485b8e2fc4dbf933ebbf/FLAG3a37e69b3 [2021-03-26 00:12:27,164 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:12:27,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2021-03-26 00:12:27,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae0095e1/8b51495c3fbf485b8e2fc4dbf933ebbf/FLAG3a37e69b3 [2021-03-26 00:12:27,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae0095e1/8b51495c3fbf485b8e2fc4dbf933ebbf [2021-03-26 00:12:27,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:12:27,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:12:27,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:27,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:12:27,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:12:27,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:27" (1/1) ... [2021-03-26 00:12:27,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd5c882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:27, skipping insertion in model container [2021-03-26 00:12:27,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:27" (1/1) ... [2021-03-26 00:12:27,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:12:27,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:12:27,808 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/mix028_pso.oepc.i[949,962] [2021-03-26 00:12:27,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:27,940 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:12:27,947 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/mix028_pso.oepc.i[949,962] [2021-03-26 00:12:27,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:28,010 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:12:28,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28 WrapperNode [2021-03-26 00:12:28,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:28,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:28,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:12:28,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:12:28,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:28,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:12:28,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:12:28,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:12:28,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (1/1) ... [2021-03-26 00:12:28,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:12:28,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:12:28,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:12:28,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:12:28,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (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-26 00:12:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:12:28,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:12:28,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:12:28,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:12:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:12:28,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:12:28,166 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:12:29,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:12:29,478 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:12:29,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:29 BoogieIcfgContainer [2021-03-26 00:12:29,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:12:29,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:12:29,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:12:29,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:12:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:12:27" (1/3) ... [2021-03-26 00:12:29,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41347b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:29, skipping insertion in model container [2021-03-26 00:12:29,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:28" (2/3) ... [2021-03-26 00:12:29,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41347b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:29, skipping insertion in model container [2021-03-26 00:12:29,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:29" (3/3) ... [2021-03-26 00:12:29,484 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_pso.oepc.i [2021-03-26 00:12:29,488 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:12:29,491 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:12:29,491 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:12:29,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:29,543 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:12:29,556 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:12:29,569 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:12:29,569 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:12:29,569 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:12:29,569 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:12:29,569 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:12:29,569 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:12:29,569 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:12:29,569 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:12:29,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 00:12:29,598 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 00:12:29,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:29,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:12:29,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-26 00:12:29,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-26 00:12:29,605 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:29,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 00:12:29,614 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-26 00:12:29,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-26 00:12:29,627 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-26 00:12:29,627 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:29,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:12:29,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 1778 [2021-03-26 00:12:30,644 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:12:31,001 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:12:31,108 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:12:31,943 INFO L154 LiptonReduction]: Checked pairs total: 3214 [2021-03-26 00:12:31,944 INFO L156 LiptonReduction]: Total number of compositions: 61 [2021-03-26 00:12:31,945 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2341 [2021-03-26 00:12:31,952 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:12:31,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:31,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:31,952 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:31,953 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1859074479, now seen corresponding path program 1 times [2021-03-26 00:12:31,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:31,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382315431] [2021-03-26 00:12:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:32,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:32,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:32,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:32,139 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-26 00:12:32,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382315431] [2021-03-26 00:12:32,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:32,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:32,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537480283] [2021-03-26 00:12:32,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:32,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:32,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 160 [2021-03-26 00:12:32,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-26 00:12:32,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:32,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 160 [2021-03-26 00:12:32,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:32,232 INFO L129 PetriNetUnfolder]: 49/145 cut-off events. [2021-03-26 00:12:32,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:32,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 145 events. 49/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 605 event pairs, 9 based on Foata normal form. 17/154 useless extension candidates. Maximal degree in co-relation 219. Up to 65 conditions per place. [2021-03-26 00:12:32,235 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-26 00:12:32,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 119 flow [2021-03-26 00:12:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-26 00:12:32,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8979166666666667 [2021-03-26 00:12:32,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-26 00:12:32,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-26 00:12:32,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:32,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-26 00:12:32,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-26 00:12:32,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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-26 00:12:32,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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-26 00:12:32,266 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 431 transitions. [2021-03-26 00:12:32,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 119 flow [2021-03-26 00:12:32,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:32,269 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2021-03-26 00:12:32,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-26 00:12:32,271 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 00:12:32,271 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:32,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:12:32,271 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:12:32,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 90 flow [2021-03-26 00:12:32,281 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:12:32,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:32,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:12:32,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:12:32,866 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:12:32,999 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:12:34,080 INFO L154 LiptonReduction]: Checked pairs total: 2002 [2021-03-26 00:12:34,080 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-26 00:12:34,080 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1809 [2021-03-26 00:12:34,081 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:12:34,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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-26 00:12:34,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:34,081 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:34,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:12:34,082 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -545745606, now seen corresponding path program 1 times [2021-03-26 00:12:34,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:34,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919703852] [2021-03-26 00:12:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:34,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:34,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:34,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:34,206 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:12:34,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:34,209 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-26 00:12:34,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919703852] [2021-03-26 00:12:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:34,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812088266] [2021-03-26 00:12:34,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:34,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:34,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 176 [2021-03-26 00:12:34,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-26 00:12:34,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:34,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 176 [2021-03-26 00:12:34,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:34,244 INFO L129 PetriNetUnfolder]: 14/58 cut-off events. [2021-03-26 00:12:34,244 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:12:34,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 58 events. 14/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 166 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 90. Up to 18 conditions per place. [2021-03-26 00:12:34,245 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 4 selfloop transitions, 3 changer transitions 7/32 dead transitions. [2021-03-26 00:12:34,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 102 flow [2021-03-26 00:12:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2021-03-26 00:12:34,247 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693181818181818 [2021-03-26 00:12:34,247 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2021-03-26 00:12:34,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2021-03-26 00:12:34,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:34,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2021-03-26 00:12:34,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 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-26 00:12:34,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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-26 00:12:34,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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-26 00:12:34,255 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 765 transitions. [2021-03-26 00:12:34,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 102 flow [2021-03-26 00:12:34,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:34,256 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-26 00:12:34,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 00:12:34,257 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -15 predicate places. [2021-03-26 00:12:34,257 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:34,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:12:34,257 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 00:12:34,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-26 00:12:34,263 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 00:12:34,263 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:12:34,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 37 events. 3/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-26 00:12:34,264 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-26 00:12:34,554 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:12:34,682 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:12:34,957 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:12:35,081 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:12:35,162 INFO L154 LiptonReduction]: Checked pairs total: 576 [2021-03-26 00:12:35,162 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:35,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 905 [2021-03-26 00:12:35,163 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2021-03-26 00:12:35,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-26 00:12:35,163 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:35,163 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:35,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:12:35,163 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash 367572605, now seen corresponding path program 1 times [2021-03-26 00:12:35,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:35,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891652218] [2021-03-26 00:12:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:35,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:35,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,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-26 00:12:35,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891652218] [2021-03-26 00:12:35,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:35,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:35,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626927012] [2021-03-26 00:12:35,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:35,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:35,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 177 [2021-03-26 00:12:35,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-26 00:12:35,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:35,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 177 [2021-03-26 00:12:35,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:35,212 INFO L129 PetriNetUnfolder]: 10/60 cut-off events. [2021-03-26 00:12:35,212 INFO L130 PetriNetUnfolder]: For 16/22 co-relation queries the response was YES. [2021-03-26 00:12:35,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 60 events. 10/60 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 3 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2021-03-26 00:12:35,213 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:12:35,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 89 flow [2021-03-26 00:12:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 00:12:35,214 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8832391713747646 [2021-03-26 00:12:35,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 00:12:35,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 00:12:35,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:35,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 00:12:35,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-26 00:12:35,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,216 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 3 states and 469 transitions. [2021-03-26 00:12:35,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 89 flow [2021-03-26 00:12:35,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 82 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:35,217 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 85 flow [2021-03-26 00:12:35,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 00:12:35,218 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -18 predicate places. [2021-03-26 00:12:35,218 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:35,218 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 00:12:35,218 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 85 flow [2021-03-26 00:12:35,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 85 flow [2021-03-26 00:12:35,222 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-26 00:12:35,222 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 00:12:35,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 47 events. 7/47 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 159 event pairs, 3 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2021-03-26 00:12:35,222 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-26 00:12:35,296 INFO L154 LiptonReduction]: Checked pairs total: 237 [2021-03-26 00:12:35,296 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:35,296 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-26 00:12:35,297 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 85 flow [2021-03-26 00:12:35,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-26 00:12:35,298 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:35,298 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:35,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:12:35,298 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 988223976, now seen corresponding path program 1 times [2021-03-26 00:12:35,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:35,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686002565] [2021-03-26 00:12:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:35,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,379 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-26 00:12:35,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686002565] [2021-03-26 00:12:35,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:35,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:12:35,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464424289] [2021-03-26 00:12:35,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:35,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:35,381 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 177 [2021-03-26 00:12:35,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-26 00:12:35,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:35,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 177 [2021-03-26 00:12:35,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:35,391 INFO L129 PetriNetUnfolder]: 8/48 cut-off events. [2021-03-26 00:12:35,392 INFO L130 PetriNetUnfolder]: For 36/40 co-relation queries the response was YES. [2021-03-26 00:12:35,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 48 events. 8/48 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 1 based on Foata normal form. 3/48 useless extension candidates. Maximal degree in co-relation 86. Up to 15 conditions per place. [2021-03-26 00:12:35,392 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-26 00:12:35,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 91 flow [2021-03-26 00:12:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-03-26 00:12:35,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 00:12:35,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-03-26 00:12:35,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-03-26 00:12:35,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:35,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-03-26 00:12:35,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-26 00:12:35,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,399 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 85 flow. Second operand 3 states and 472 transitions. [2021-03-26 00:12:35,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 91 flow [2021-03-26 00:12:35,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:35,400 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2021-03-26 00:12:35,400 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:12:35,400 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2021-03-26 00:12:35,400 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:35,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 90 flow [2021-03-26 00:12:35,401 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 90 flow [2021-03-26 00:12:35,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 90 flow [2021-03-26 00:12:35,406 INFO L129 PetriNetUnfolder]: 5/41 cut-off events. [2021-03-26 00:12:35,406 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 00:12:35,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 41 events. 5/41 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 71. Up to 12 conditions per place. [2021-03-26 00:12:35,408 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-26 00:12:35,412 INFO L154 LiptonReduction]: Checked pairs total: 222 [2021-03-26 00:12:35,412 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:35,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 00:12:35,414 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2021-03-26 00:12:35,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-26 00:12:35,414 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:35,414 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:35,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:12:35,415 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash -233051920, now seen corresponding path program 1 times [2021-03-26 00:12:35,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:35,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53968672] [2021-03-26 00:12:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:35,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:35,498 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:12:35,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:35,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:35,510 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-26 00:12:35,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53968672] [2021-03-26 00:12:35,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:35,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:35,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80115896] [2021-03-26 00:12:35,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:35,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:35,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:35,512 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-26 00:12:35,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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-26 00:12:35,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:35,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-26 00:12:35,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:35,559 INFO L129 PetriNetUnfolder]: 54/147 cut-off events. [2021-03-26 00:12:35,560 INFO L130 PetriNetUnfolder]: For 47/55 co-relation queries the response was YES. [2021-03-26 00:12:35,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 147 events. 54/147 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 683 event pairs, 19 based on Foata normal form. 13/145 useless extension candidates. Maximal degree in co-relation 317. Up to 70 conditions per place. [2021-03-26 00:12:35,562 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-26 00:12:35,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 142 flow [2021-03-26 00:12:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2021-03-26 00:12:35,564 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8621468926553673 [2021-03-26 00:12:35,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2021-03-26 00:12:35,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2021-03-26 00:12:35,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:35,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2021-03-26 00:12:35,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 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-26 00:12:35,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 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-26 00:12:35,567 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 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-26 00:12:35,567 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 5 states and 763 transitions. [2021-03-26 00:12:35,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 142 flow [2021-03-26 00:12:35,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:35,570 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 146 flow [2021-03-26 00:12:35,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-26 00:12:35,570 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-26 00:12:35,571 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:35,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 146 flow [2021-03-26 00:12:35,576 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 146 flow [2021-03-26 00:12:35,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 146 flow [2021-03-26 00:12:35,589 INFO L129 PetriNetUnfolder]: 58/146 cut-off events. [2021-03-26 00:12:35,589 INFO L130 PetriNetUnfolder]: For 116/121 co-relation queries the response was YES. [2021-03-26 00:12:35,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 146 events. 58/146 cut-off events. For 116/121 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 656 event pairs, 25 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 390. Up to 77 conditions per place. [2021-03-26 00:12:35,590 INFO L142 LiptonReduction]: Number of co-enabled transitions 390 [2021-03-26 00:12:35,688 INFO L154 LiptonReduction]: Checked pairs total: 501 [2021-03-26 00:12:35,688 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:35,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-26 00:12:35,689 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 140 flow [2021-03-26 00:12:35,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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-26 00:12:35,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:35,691 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:35,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:12:35,692 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1715251442, now seen corresponding path program 1 times [2021-03-26 00:12:35,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:35,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321876579] [2021-03-26 00:12:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:35,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:35,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,737 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-26 00:12:35,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321876579] [2021-03-26 00:12:35,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:35,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:35,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265068064] [2021-03-26 00:12:35,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:35,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:35,739 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 177 [2021-03-26 00:12:35,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-26 00:12:35,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:35,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 177 [2021-03-26 00:12:35,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:35,758 INFO L129 PetriNetUnfolder]: 64/170 cut-off events. [2021-03-26 00:12:35,758 INFO L130 PetriNetUnfolder]: For 262/327 co-relation queries the response was YES. [2021-03-26 00:12:35,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 170 events. 64/170 cut-off events. For 262/327 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 828 event pairs, 27 based on Foata normal form. 11/162 useless extension candidates. Maximal degree in co-relation 467. Up to 97 conditions per place. [2021-03-26 00:12:35,759 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 00:12:35,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 134 flow [2021-03-26 00:12:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2021-03-26 00:12:35,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8813559322033898 [2021-03-26 00:12:35,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2021-03-26 00:12:35,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2021-03-26 00:12:35,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:35,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2021-03-26 00:12:35,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-26 00:12:35,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 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-26 00:12:35,763 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 140 flow. Second operand 3 states and 468 transitions. [2021-03-26 00:12:35,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 134 flow [2021-03-26 00:12:35,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 128 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:35,765 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 127 flow [2021-03-26 00:12:35,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-26 00:12:35,765 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2021-03-26 00:12:35,765 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:35,765 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 127 flow [2021-03-26 00:12:35,765 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 127 flow [2021-03-26 00:12:35,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 127 flow [2021-03-26 00:12:35,778 INFO L129 PetriNetUnfolder]: 68/171 cut-off events. [2021-03-26 00:12:35,778 INFO L130 PetriNetUnfolder]: For 205/230 co-relation queries the response was YES. [2021-03-26 00:12:35,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 171 events. 68/171 cut-off events. For 205/230 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 843 event pairs, 31 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 446. Up to 100 conditions per place. [2021-03-26 00:12:35,779 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 00:12:35,925 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-26 00:12:35,925 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:35,925 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-03-26 00:12:35,926 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 127 flow [2021-03-26 00:12:35,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-26 00:12:35,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:35,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:35,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:12:35,927 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -119776090, now seen corresponding path program 1 times [2021-03-26 00:12:35,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:35,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932768488] [2021-03-26 00:12:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:35,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:35,968 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:12:35,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:35,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:35,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:35,974 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-26 00:12:35,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932768488] [2021-03-26 00:12:35,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:35,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:12:35,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196314810] [2021-03-26 00:12:35,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:35,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:35,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-26 00:12:35,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-26 00:12:35,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:35,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-26 00:12:35,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:36,019 INFO L129 PetriNetUnfolder]: 39/131 cut-off events. [2021-03-26 00:12:36,019 INFO L130 PetriNetUnfolder]: For 137/220 co-relation queries the response was YES. [2021-03-26 00:12:36,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 131 events. 39/131 cut-off events. For 137/220 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 576 event pairs, 4 based on Foata normal form. 29/152 useless extension candidates. Maximal degree in co-relation 417. Up to 82 conditions per place. [2021-03-26 00:12:36,020 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 5 selfloop transitions, 10 changer transitions 4/39 dead transitions. [2021-03-26 00:12:36,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 223 flow [2021-03-26 00:12:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:12:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:12:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2021-03-26 00:12:36,022 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615819209039548 [2021-03-26 00:12:36,022 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2021-03-26 00:12:36,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2021-03-26 00:12:36,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:36,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2021-03-26 00:12:36,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 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-26 00:12:36,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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-26 00:12:36,025 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 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-26 00:12:36,025 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 127 flow. Second operand 6 states and 915 transitions. [2021-03-26 00:12:36,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 223 flow [2021-03-26 00:12:36,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 218 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:36,026 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 202 flow [2021-03-26 00:12:36,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-26 00:12:36,027 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2021-03-26 00:12:36,027 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:36,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 202 flow [2021-03-26 00:12:36,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 202 flow [2021-03-26 00:12:36,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 202 flow [2021-03-26 00:12:36,037 INFO L129 PetriNetUnfolder]: 30/119 cut-off events. [2021-03-26 00:12:36,037 INFO L130 PetriNetUnfolder]: For 221/240 co-relation queries the response was YES. [2021-03-26 00:12:36,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 119 events. 30/119 cut-off events. For 221/240 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 535 event pairs, 5 based on Foata normal form. 3/116 useless extension candidates. Maximal degree in co-relation 426. Up to 73 conditions per place. [2021-03-26 00:12:36,038 INFO L142 LiptonReduction]: Number of co-enabled transitions 352 [2021-03-26 00:12:36,086 INFO L154 LiptonReduction]: Checked pairs total: 626 [2021-03-26 00:12:36,086 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:36,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 00:12:36,087 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 194 flow [2021-03-26 00:12:36,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-26 00:12:36,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:36,088 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:36,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:12:36,088 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1213912471, now seen corresponding path program 1 times [2021-03-26 00:12:36,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:36,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110392365] [2021-03-26 00:12:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:36,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:36,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:36,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:36,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:36,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:36,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:36,192 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 00:12:36,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:12:36,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:36,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:36,198 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-26 00:12:36,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110392365] [2021-03-26 00:12:36,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:36,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:36,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051694053] [2021-03-26 00:12:36,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:12:36,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:36,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:12:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:12:36,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 177 [2021-03-26 00:12:36,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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-26 00:12:36,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:36,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 177 [2021-03-26 00:12:36,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:36,241 INFO L129 PetriNetUnfolder]: 18/79 cut-off events. [2021-03-26 00:12:36,241 INFO L130 PetriNetUnfolder]: For 178/234 co-relation queries the response was YES. [2021-03-26 00:12:36,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 79 events. 18/79 cut-off events. For 178/234 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 0 based on Foata normal form. 28/102 useless extension candidates. Maximal degree in co-relation 292. Up to 46 conditions per place. [2021-03-26 00:12:36,242 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 2 selfloop transitions, 11 changer transitions 5/36 dead transitions. [2021-03-26 00:12:36,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 238 flow [2021-03-26 00:12:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:12:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:12:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-03-26 00:12:36,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8563357546408394 [2021-03-26 00:12:36,244 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-03-26 00:12:36,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-03-26 00:12:36,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:36,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-03-26 00:12:36,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 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-26 00:12:36,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 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-26 00:12:36,247 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 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-26 00:12:36,248 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 194 flow. Second operand 7 states and 1061 transitions. [2021-03-26 00:12:36,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 238 flow [2021-03-26 00:12:36,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 206 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-26 00:12:36,250 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 176 flow [2021-03-26 00:12:36,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2021-03-26 00:12:36,250 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2021-03-26 00:12:36,250 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:36,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 176 flow [2021-03-26 00:12:36,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 31 transitions, 176 flow [2021-03-26 00:12:36,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 176 flow [2021-03-26 00:12:36,254 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-26 00:12:36,254 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-03-26 00:12:36,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 41 events. 7/41 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 126. Up to 15 conditions per place. [2021-03-26 00:12:36,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-26 00:12:36,542 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:12:36,674 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:12:37,062 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:12:37,194 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:12:37,338 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:12:37,346 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 00:12:37,346 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:12:37,346 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1096 [2021-03-26 00:12:37,348 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 162 flow [2021-03-26 00:12:37,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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-26 00:12:37,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:37,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:37,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:12:37,349 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -364096750, now seen corresponding path program 1 times [2021-03-26 00:12:37,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:37,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297478854] [2021-03-26 00:12:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:37,554 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.3 percent of original size [2021-03-26 00:12:37,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 00:12:37,579 INFO L142 QuantifierPusher]: treesize reduction 19, result has 85.0 percent of original size [2021-03-26 00:12:37,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 108 [2021-03-26 00:12:37,652 INFO L142 QuantifierPusher]: treesize reduction 12, result has 90.3 percent of original size [2021-03-26 00:12:37,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-03-26 00:12:37,727 INFO L142 QuantifierPusher]: treesize reduction 28, result has 77.8 percent of original size [2021-03-26 00:12:37,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-03-26 00:12:37,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:37,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:37,783 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-26 00:12:37,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297478854] [2021-03-26 00:12:37,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:37,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:37,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315438779] [2021-03-26 00:12:37,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:12:37,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:12:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:12:37,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 181 [2021-03-26 00:12:37,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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-26 00:12:37,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:37,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 181 [2021-03-26 00:12:37,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:38,032 INFO L129 PetriNetUnfolder]: 37/119 cut-off events. [2021-03-26 00:12:38,032 INFO L130 PetriNetUnfolder]: For 460/495 co-relation queries the response was YES. [2021-03-26 00:12:38,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 119 events. 37/119 cut-off events. For 460/495 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 0 based on Foata normal form. 19/135 useless extension candidates. Maximal degree in co-relation 393. Up to 39 conditions per place. [2021-03-26 00:12:38,033 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 11 selfloop transitions, 9 changer transitions 4/44 dead transitions. [2021-03-26 00:12:38,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 258 flow [2021-03-26 00:12:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 00:12:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 00:12:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1275 transitions. [2021-03-26 00:12:38,035 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7044198895027625 [2021-03-26 00:12:38,035 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1275 transitions. [2021-03-26 00:12:38,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1275 transitions. [2021-03-26 00:12:38,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:38,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1275 transitions. [2021-03-26 00:12:38,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 127.5) internal successors, (1275), 10 states have internal predecessors, (1275), 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-26 00:12:38,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 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-26 00:12:38,042 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 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-26 00:12:38,042 INFO L185 Difference]: Start difference. First operand has 45 places, 27 transitions, 162 flow. Second operand 10 states and 1275 transitions. [2021-03-26 00:12:38,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 258 flow [2021-03-26 00:12:38,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 206 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-03-26 00:12:38,046 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 170 flow [2021-03-26 00:12:38,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2021-03-26 00:12:38,046 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 00:12:38,047 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:38,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 170 flow [2021-03-26 00:12:38,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 170 flow [2021-03-26 00:12:38,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 170 flow [2021-03-26 00:12:38,054 INFO L129 PetriNetUnfolder]: 24/85 cut-off events. [2021-03-26 00:12:38,055 INFO L130 PetriNetUnfolder]: For 148/160 co-relation queries the response was YES. [2021-03-26 00:12:38,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 85 events. 24/85 cut-off events. For 148/160 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 287 event pairs, 1 based on Foata normal form. 9/91 useless extension candidates. Maximal degree in co-relation 230. Up to 31 conditions per place. [2021-03-26 00:12:38,055 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-26 00:12:38,085 INFO L154 LiptonReduction]: Checked pairs total: 75 [2021-03-26 00:12:38,086 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:38,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 00:12:38,086 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 168 flow [2021-03-26 00:12:38,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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-26 00:12:38,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:38,087 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:38,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:12:38,087 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:12:38,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2140627417, now seen corresponding path program 1 times [2021-03-26 00:12:38,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:38,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792645778] [2021-03-26 00:12:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:38,143 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:12:38,180 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:12:38,214 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:12:38,214 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:12:38,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:12:38,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:12:38 BasicIcfg [2021-03-26 00:12:38,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:12:38,294 INFO L168 Benchmark]: Toolchain (without parser) took 10630.24 ms. Allocated memory was 408.9 MB in the beginning and 690.0 MB in the end (delta: 281.0 MB). Free memory was 371.5 MB in the beginning and 400.0 MB in the end (delta: -28.6 MB). Peak memory consumption was 253.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,294 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 408.9 MB. Free memory was 389.8 MB in the beginning and 389.7 MB in the end (delta: 75.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:12:38,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.89 ms. Allocated memory is still 408.9 MB. Free memory was 371.3 MB in the beginning and 368.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 408.9 MB. Free memory was 368.2 MB in the beginning and 366.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,295 INFO L168 Benchmark]: Boogie Preprocessor took 33.43 ms. Allocated memory is still 408.9 MB. Free memory was 366.1 MB in the beginning and 363.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,295 INFO L168 Benchmark]: RCFGBuilder took 1381.92 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 309.2 MB in the end (delta: 53.7 MB). Peak memory consumption was 156.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,295 INFO L168 Benchmark]: TraceAbstraction took 8813.42 ms. Allocated memory was 408.9 MB in the beginning and 690.0 MB in the end (delta: 281.0 MB). Free memory was 309.2 MB in the beginning and 400.0 MB in the end (delta: -90.8 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:12:38,296 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.44 ms. Allocated memory is still 408.9 MB. Free memory was 389.8 MB in the beginning and 389.7 MB in the end (delta: 75.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 344.89 ms. Allocated memory is still 408.9 MB. Free memory was 371.3 MB in the beginning and 368.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 408.9 MB. Free memory was 368.2 MB in the beginning and 366.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 33.43 ms. Allocated memory is still 408.9 MB. Free memory was 366.1 MB in the beginning and 363.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1381.92 ms. Allocated memory is still 408.9 MB. Free memory was 363.0 MB in the beginning and 309.2 MB in the end (delta: 53.7 MB). Peak memory consumption was 156.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8813.42 ms. Allocated memory was 408.9 MB in the beginning and 690.0 MB in the end (delta: 281.0 MB). Free memory was 309.2 MB in the beginning and 400.0 MB in the end (delta: -90.8 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2329.4ms, 104 PlacesBefore, 52 PlacesAfterwards, 96 TransitionsBefore, 43 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 4 FixpointIterations, 24 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 61 TotalNumberOfCompositions, 3214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1657, positive: 1576, positive conditional: 1576, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1223, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1223, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1223, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 406, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 384, negative conditional: 0, negative unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1657, positive: 393, positive conditional: 393, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 1223, unknown conditional: 1223, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 79, Positive conditional cache size: 79, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1808.3ms, 49 PlacesBefore, 33 PlacesAfterwards, 40 TransitionsBefore, 24 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 2002 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 568, positive: 439, positive conditional: 439, positive unconditional: 0, negative: 129, negative conditional: 129, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, positive: 134, positive conditional: 21, positive unconditional: 113, negative: 22, negative conditional: 9, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, positive: 134, positive conditional: 21, positive unconditional: 113, negative: 22, negative conditional: 9, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 22, negative conditional: 9, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 214, negative conditional: 140, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 568, positive: 305, positive conditional: 305, positive unconditional: 0, negative: 107, negative conditional: 107, negative unconditional: 0, unknown: 156, unknown conditional: 156, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 94, Positive conditional cache size: 94, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 904.6ms, 37 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 576 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 97, negative conditional: 0, negative unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 112, Positive conditional cache size: 112, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.4ms, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.9ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 501 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 153, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 43, positive conditional: 26, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 43, positive conditional: 26, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 6, positive conditional: 1, positive unconditional: 5, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 6, positive conditional: 1, positive unconditional: 5, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 145, Positive conditional cache size: 145, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.9ms, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 626 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, positive: 158, positive conditional: 158, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 38, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 38, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 173, Positive conditional cache size: 173, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1095.7ms, 50 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 228, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 61, positive conditional: 53, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, positive: 61, positive conditional: 53, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 67, unknown conditional: 67, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.8ms, 49 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 75 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t751; [L837] FCALL, FORK 0 pthread_create(&t751, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t752; [L839] FCALL, FORK 0 pthread_create(&t752, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 [L775] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t753; [L841] FCALL, FORK 0 pthread_create(&t753, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=50, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 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: 8648.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 654.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2380.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 15 SDslu, 15 SDs, 0 SdLazy, 186 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 189.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 378.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=7, InterpolantAutomatonStates: 45, 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: 25.4ms SsaConstructionTime, 396.1ms SatisfiabilityAnalysisTime, 685.5ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...