/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:34:54,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:34:54,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:34:54,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:34:54,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:34:54,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:34:54,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:34:54,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:34:54,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:34:54,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:34:54,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:34:54,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:34:54,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:34:54,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:34:54,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:34:54,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:34:54,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:34:54,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:34:54,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:34:54,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:34:54,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:34:54,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:34:54,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:34:54,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:34:54,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:34:54,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:34:54,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:34:54,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:34:54,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:34:54,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:34:54,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:34:54,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:34:54,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:34:54,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:34:54,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:34:54,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:34:54,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:34:54,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:34:54,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:34:54,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:34:54,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:34:54,457 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-RepeatedVariableLbe.epf [2021-03-25 04:34:54,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:34:54,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:34:54,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:34:54,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:34:54,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:34:54,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:34:54,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:34:54,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:34:54,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:34:54,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:34:54,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:34:54,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:34:54,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:34:54,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:34:54,488 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-25 04:34:54,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:34:54,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:34:54,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:34:54,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:34:54,791 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:34:54,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2021-03-25 04:34:54,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae339b6/eabaf3a2bc8c405cbe93ac0d81cc62ad/FLAG410678ff4 [2021-03-25 04:34:55,310 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:34:55,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2021-03-25 04:34:55,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae339b6/eabaf3a2bc8c405cbe93ac0d81cc62ad/FLAG410678ff4 [2021-03-25 04:34:55,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ae339b6/eabaf3a2bc8c405cbe93ac0d81cc62ad [2021-03-25 04:34:55,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:34:55,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:34:55,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:34:55,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:34:55,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:34:55,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1123acb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55, skipping insertion in model container [2021-03-25 04:34:55,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:34:55,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:34:55,605 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/mix016_rmo.opt.i[991,1004] [2021-03-25 04:34:55,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:34:55,808 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:34:55,820 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/mix016_rmo.opt.i[991,1004] [2021-03-25 04:34:55,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:34:55,938 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:34:55,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55 WrapperNode [2021-03-25 04:34:55,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:34:55,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:34:55,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:34:55,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:34:55,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:34:55,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:34:55,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:34:55,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:34:55,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:55,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:56,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:56,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (1/1) ... [2021-03-25 04:34:56,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:34:56,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:34:56,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:34:56,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:34:56,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (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-25 04:34:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:34:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:34:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:34:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:34:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:34:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:34:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:34:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:34:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:34:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:34:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:34:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:34:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:34:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:34:56,100 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:34:57,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:34:57,602 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:34:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:34:57 BoogieIcfgContainer [2021-03-25 04:34:57,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:34:57,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:34:57,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:34:57,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:34:57,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:34:55" (1/3) ... [2021-03-25 04:34:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39564375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:34:57, skipping insertion in model container [2021-03-25 04:34:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:34:55" (2/3) ... [2021-03-25 04:34:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39564375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:34:57, skipping insertion in model container [2021-03-25 04:34:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:34:57" (3/3) ... [2021-03-25 04:34:57,636 INFO L111 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2021-03-25 04:34:57,644 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:34:57,648 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:34:57,648 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:34:57,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,701 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:34:57,726 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:34:57,741 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:34:57,767 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:34:57,767 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:34:57,767 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:34:57,767 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:34:57,767 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:34:57,768 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:34:57,768 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:34:57,768 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:34:57,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-25 04:34:57,819 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-25 04:34:57,820 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:34:57,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:34:57,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-25 04:34:57,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-25 04:34:57,831 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:34:57,838 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-25 04:34:57,840 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-25 04:34:57,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-25 04:34:57,872 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-25 04:34:57,872 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:34:57,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:34:57,877 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-25 04:34:58,652 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:34:59,078 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:34:59,206 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:35:00,393 INFO L154 LiptonReduction]: Checked pairs total: 2931 [2021-03-25 04:35:00,394 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-25 04:35:00,395 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2565 [2021-03-25 04:35:00,403 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:35:00,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:35:00,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:00,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:00,404 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1168439435, now seen corresponding path program 1 times [2021-03-25 04:35:00,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:00,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189346610] [2021-03-25 04:35:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:00,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:00,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:00,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:00,620 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-25 04:35:00,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189346610] [2021-03-25 04:35:00,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:00,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:35:00,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638573285] [2021-03-25 04:35:00,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:35:00,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:35:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:35:00,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166 [2021-03-25 04:35:00,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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-25 04:35:00,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:00,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166 [2021-03-25 04:35:00,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:00,748 INFO L129 PetriNetUnfolder]: 29/131 cut-off events. [2021-03-25 04:35:00,748 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:35:00,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 131 events. 29/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 515 event pairs, 15 based on Foata normal form. 10/124 useless extension candidates. Maximal degree in co-relation 177. Up to 41 conditions per place. [2021-03-25 04:35:00,751 INFO L132 encePairwiseOnDemand]: 162/166 looper letters, 7 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-25 04:35:00,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 101 flow [2021-03-25 04:35:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:35:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:35:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2021-03-25 04:35:00,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9036144578313253 [2021-03-25 04:35:00,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2021-03-25 04:35:00,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2021-03-25 04:35:00,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:00,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2021-03-25 04:35:00,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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-25 04:35:00,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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-25 04:35:00,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 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-25 04:35:00,788 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 450 transitions. [2021-03-25 04:35:00,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 101 flow [2021-03-25 04:35:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:35:00,792 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-25 04:35:00,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-25 04:35:00,794 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-25 04:35:00,794 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:00,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 04:35:00,795 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 04:35:00,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-25 04:35:00,801 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-25 04:35:00,801 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:35:00,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:35:00,802 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-25 04:35:01,848 INFO L154 LiptonReduction]: Checked pairs total: 1374 [2021-03-25 04:35:01,848 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 04:35:01,849 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1055 [2021-03-25 04:35:01,849 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 04:35:01,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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-25 04:35:01,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:01,850 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:01,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:35:01,850 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -416592010, now seen corresponding path program 1 times [2021-03-25 04:35:01,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:01,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707963382] [2021-03-25 04:35:01,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:01,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:01,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:01,985 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:35:01,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:35:01,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:01,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:01,997 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-25 04:35:01,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707963382] [2021-03-25 04:35:01,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:01,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:35:01,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214220103] [2021-03-25 04:35:01,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:35:01,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:35:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:35:02,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 178 [2021-03-25 04:35:02,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:35:02,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:02,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 178 [2021-03-25 04:35:02,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:02,101 INFO L129 PetriNetUnfolder]: 52/149 cut-off events. [2021-03-25 04:35:02,101 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:35:02,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 149 events. 52/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 692 event pairs, 14 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 248. Up to 49 conditions per place. [2021-03-25 04:35:02,103 INFO L132 encePairwiseOnDemand]: 171/178 looper letters, 5 selfloop transitions, 4 changer transitions 10/35 dead transitions. [2021-03-25 04:35:02,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 118 flow [2021-03-25 04:35:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:35:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:35:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-25 04:35:02,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8033707865168539 [2021-03-25 04:35:02,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-25 04:35:02,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-25 04:35:02,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:02,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-25 04:35:02,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 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-25 04:35:02,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-25 04:35:02,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-25 04:35:02,114 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 715 transitions. [2021-03-25 04:35:02,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 118 flow [2021-03-25 04:35:02,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:35:02,115 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 84 flow [2021-03-25 04:35:02,115 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-25 04:35:02,115 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-25 04:35:02,116 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:02,116 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 84 flow [2021-03-25 04:35:02,116 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 84 flow [2021-03-25 04:35:02,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 84 flow [2021-03-25 04:35:02,125 INFO L129 PetriNetUnfolder]: 22/75 cut-off events. [2021-03-25 04:35:02,125 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-25 04:35:02,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 75 events. 22/75 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 252 event pairs, 10 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 149. Up to 38 conditions per place. [2021-03-25 04:35:02,126 INFO L142 LiptonReduction]: Number of co-enabled transitions 222 [2021-03-25 04:35:02,384 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:35:02,495 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:35:02,746 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:35:02,866 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:35:02,873 INFO L154 LiptonReduction]: Checked pairs total: 324 [2021-03-25 04:35:02,873 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:35:02,874 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 758 [2021-03-25 04:35:02,874 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 82 flow [2021-03-25 04:35:02,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:35:02,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:02,875 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:02,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:35:02,875 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1287582613, now seen corresponding path program 1 times [2021-03-25 04:35:02,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:02,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831748867] [2021-03-25 04:35:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:02,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:02,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:02,964 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-25 04:35:02,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831748867] [2021-03-25 04:35:02,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:02,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:35:02,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304392771] [2021-03-25 04:35:02,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:35:02,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:02,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:35:02,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:35:02,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 179 [2021-03-25 04:35:02,967 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:35:02,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:02,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 179 [2021-03-25 04:35:02,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:02,983 INFO L129 PetriNetUnfolder]: 16/67 cut-off events. [2021-03-25 04:35:02,983 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-03-25 04:35:02,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 67 events. 16/67 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 218 event pairs, 5 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 137. Up to 31 conditions per place. [2021-03-25 04:35:02,984 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 1 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-25 04:35:02,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 90 flow [2021-03-25 04:35:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:35:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:35:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-25 04:35:02,993 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8733705772811918 [2021-03-25 04:35:02,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-25 04:35:02,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-25 04:35:02,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:02,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-25 04:35:02,995 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-25 04:35:02,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-25 04:35:02,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-25 04:35:02,996 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 82 flow. Second operand 3 states and 469 transitions. [2021-03-25 04:35:02,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 90 flow [2021-03-25 04:35:02,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:35:02,998 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 89 flow [2021-03-25 04:35:02,998 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-25 04:35:02,998 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -12 predicate places. [2021-03-25 04:35:02,998 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:02,998 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 89 flow [2021-03-25 04:35:02,998 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 89 flow [2021-03-25 04:35:02,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 89 flow [2021-03-25 04:35:03,016 INFO L129 PetriNetUnfolder]: 16/67 cut-off events. [2021-03-25 04:35:03,016 INFO L130 PetriNetUnfolder]: For 27/30 co-relation queries the response was YES. [2021-03-25 04:35:03,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 67 events. 16/67 cut-off events. For 27/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 220 event pairs, 12 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 138. Up to 31 conditions per place. [2021-03-25 04:35:03,019 INFO L142 LiptonReduction]: Number of co-enabled transitions 220 [2021-03-25 04:35:03,022 INFO L154 LiptonReduction]: Checked pairs total: 155 [2021-03-25 04:35:03,022 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:35:03,022 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 04:35:03,027 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 89 flow [2021-03-25 04:35:03,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:35:03,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:03,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:03,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:35:03,028 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash 93565136, now seen corresponding path program 1 times [2021-03-25 04:35:03,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:03,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289338278] [2021-03-25 04:35:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:03,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,101 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:35:03,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:35:03,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:03,108 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-25 04:35:03,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289338278] [2021-03-25 04:35:03,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:03,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:35:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958269053] [2021-03-25 04:35:03,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:35:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:35:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:35:03,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 179 [2021-03-25 04:35:03,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 89 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-25 04:35:03,113 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:03,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 179 [2021-03-25 04:35:03,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:03,158 INFO L129 PetriNetUnfolder]: 65/174 cut-off events. [2021-03-25 04:35:03,159 INFO L130 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2021-03-25 04:35:03,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 174 events. 65/174 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 849 event pairs, 26 based on Foata normal form. 17/180 useless extension candidates. Maximal degree in co-relation 374. Up to 91 conditions per place. [2021-03-25 04:35:03,160 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2021-03-25 04:35:03,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 141 flow [2021-03-25 04:35:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:35:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:35:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 768 transitions. [2021-03-25 04:35:03,163 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581005586592179 [2021-03-25 04:35:03,163 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 768 transitions. [2021-03-25 04:35:03,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 768 transitions. [2021-03-25 04:35:03,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:03,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 768 transitions. [2021-03-25 04:35:03,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 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-25 04:35:03,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-25 04:35:03,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-25 04:35:03,168 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 89 flow. Second operand 5 states and 768 transitions. [2021-03-25 04:35:03,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 141 flow [2021-03-25 04:35:03,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:35:03,170 INFO L241 Difference]: Finished difference. Result has 39 places, 31 transitions, 143 flow [2021-03-25 04:35:03,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2021-03-25 04:35:03,170 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-25 04:35:03,170 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:03,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 143 flow [2021-03-25 04:35:03,171 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 143 flow [2021-03-25 04:35:03,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 143 flow [2021-03-25 04:35:03,188 INFO L129 PetriNetUnfolder]: 65/179 cut-off events. [2021-03-25 04:35:03,188 INFO L130 PetriNetUnfolder]: For 111/132 co-relation queries the response was YES. [2021-03-25 04:35:03,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 179 events. 65/179 cut-off events. For 111/132 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 902 event pairs, 31 based on Foata normal form. 4/170 useless extension candidates. Maximal degree in co-relation 482. Up to 95 conditions per place. [2021-03-25 04:35:03,191 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-25 04:35:03,200 INFO L154 LiptonReduction]: Checked pairs total: 346 [2021-03-25 04:35:03,200 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:35:03,200 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 04:35:03,201 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 137 flow [2021-03-25 04:35:03,201 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-25 04:35:03,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:03,202 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:03,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:35:03,202 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2123432409, now seen corresponding path program 1 times [2021-03-25 04:35:03,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:03,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361011941] [2021-03-25 04:35:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:03,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,318 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:35:03,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:35:03,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:03,325 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-25 04:35:03,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361011941] [2021-03-25 04:35:03,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:03,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:35:03,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411112948] [2021-03-25 04:35:03,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:35:03,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:35:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:35:03,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 179 [2021-03-25 04:35:03,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 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-25 04:35:03,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:03,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 179 [2021-03-25 04:35:03,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:03,416 INFO L129 PetriNetUnfolder]: 33/112 cut-off events. [2021-03-25 04:35:03,416 INFO L130 PetriNetUnfolder]: For 103/132 co-relation queries the response was YES. [2021-03-25 04:35:03,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 112 events. 33/112 cut-off events. For 103/132 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 446 event pairs, 6 based on Foata normal form. 30/140 useless extension candidates. Maximal degree in co-relation 353. Up to 62 conditions per place. [2021-03-25 04:35:03,418 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 11 changer transitions 3/37 dead transitions. [2021-03-25 04:35:03,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 215 flow [2021-03-25 04:35:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:35:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:35:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 921 transitions. [2021-03-25 04:35:03,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8575418994413407 [2021-03-25 04:35:03,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 921 transitions. [2021-03-25 04:35:03,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 921 transitions. [2021-03-25 04:35:03,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:03,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 921 transitions. [2021-03-25 04:35:03,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.5) internal successors, (921), 6 states have internal predecessors, (921), 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-25 04:35:03,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-25 04:35:03,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-25 04:35:03,427 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 137 flow. Second operand 6 states and 921 transitions. [2021-03-25 04:35:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 215 flow [2021-03-25 04:35:03,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 209 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:35:03,431 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 201 flow [2021-03-25 04:35:03,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-25 04:35:03,432 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-25 04:35:03,432 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:03,432 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 201 flow [2021-03-25 04:35:03,432 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 201 flow [2021-03-25 04:35:03,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 201 flow [2021-03-25 04:35:03,449 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-03-25 04:35:03,450 INFO L130 PetriNetUnfolder]: For 183/197 co-relation queries the response was YES. [2021-03-25 04:35:03,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 111 events. 31/111 cut-off events. For 183/197 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 472 event pairs, 9 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 374. Up to 61 conditions per place. [2021-03-25 04:35:03,451 INFO L142 LiptonReduction]: Number of co-enabled transitions 288 [2021-03-25 04:35:03,456 INFO L154 LiptonReduction]: Checked pairs total: 273 [2021-03-25 04:35:03,456 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:35:03,456 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 04:35:03,459 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 193 flow [2021-03-25 04:35:03,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 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-25 04:35:03,460 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:03,460 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:03,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:35:03,460 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1866277531, now seen corresponding path program 1 times [2021-03-25 04:35:03,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:03,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294387304] [2021-03-25 04:35:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:03,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:03,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,528 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:35:03,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:35:03,535 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-25 04:35:03,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294387304] [2021-03-25 04:35:03,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:03,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:35:03,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955732110] [2021-03-25 04:35:03,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:35:03,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:03,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:35:03,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:35:03,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 179 [2021-03-25 04:35:03,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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-25 04:35:03,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:03,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 179 [2021-03-25 04:35:03,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:03,581 INFO L129 PetriNetUnfolder]: 46/152 cut-off events. [2021-03-25 04:35:03,581 INFO L130 PetriNetUnfolder]: For 239/264 co-relation queries the response was YES. [2021-03-25 04:35:03,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 152 events. 46/152 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 641 event pairs, 5 based on Foata normal form. 13/162 useless extension candidates. Maximal degree in co-relation 518. Up to 70 conditions per place. [2021-03-25 04:35:03,582 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 8 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2021-03-25 04:35:03,582 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 247 flow [2021-03-25 04:35:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:35:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:35:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2021-03-25 04:35:03,585 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7966480446927374 [2021-03-25 04:35:03,585 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2021-03-25 04:35:03,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2021-03-25 04:35:03,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:03,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2021-03-25 04:35:03,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 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-25 04:35:03,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-25 04:35:03,589 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-25 04:35:03,589 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 193 flow. Second operand 5 states and 713 transitions. [2021-03-25 04:35:03,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 247 flow [2021-03-25 04:35:03,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 227 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 04:35:03,592 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 214 flow [2021-03-25 04:35:03,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-25 04:35:03,592 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2021-03-25 04:35:03,592 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:03,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 214 flow [2021-03-25 04:35:03,592 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 214 flow [2021-03-25 04:35:03,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 214 flow [2021-03-25 04:35:03,607 INFO L129 PetriNetUnfolder]: 42/144 cut-off events. [2021-03-25 04:35:03,607 INFO L130 PetriNetUnfolder]: For 163/167 co-relation queries the response was YES. [2021-03-25 04:35:03,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 144 events. 42/144 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 614 event pairs, 5 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 436. Up to 46 conditions per place. [2021-03-25 04:35:03,609 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 04:35:03,626 INFO L154 LiptonReduction]: Checked pairs total: 302 [2021-03-25 04:35:03,626 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:35:03,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-25 04:35:03,627 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 216 flow [2021-03-25 04:35:03,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 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-25 04:35:03,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:03,627 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:03,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:35:03,627 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1620560943, now seen corresponding path program 2 times [2021-03-25 04:35:03,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:03,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045723371] [2021-03-25 04:35:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:03,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:03,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:03,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:03,673 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:35:03,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:35:03,681 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-25 04:35:03,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045723371] [2021-03-25 04:35:03,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:03,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:35:03,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415376062] [2021-03-25 04:35:03,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:35:03,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:35:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:35:03,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 180 [2021-03-25 04:35:03,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 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-25 04:35:03,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:03,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 180 [2021-03-25 04:35:03,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:03,737 INFO L129 PetriNetUnfolder]: 56/177 cut-off events. [2021-03-25 04:35:03,738 INFO L130 PetriNetUnfolder]: For 304/348 co-relation queries the response was YES. [2021-03-25 04:35:03,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 177 events. 56/177 cut-off events. For 304/348 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 794 event pairs, 8 based on Foata normal form. 23/197 useless extension candidates. Maximal degree in co-relation 594. Up to 63 conditions per place. [2021-03-25 04:35:03,739 INFO L132 encePairwiseOnDemand]: 172/180 looper letters, 8 selfloop transitions, 8 changer transitions 5/41 dead transitions. [2021-03-25 04:35:03,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 297 flow [2021-03-25 04:35:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:35:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:35:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 854 transitions. [2021-03-25 04:35:03,742 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7907407407407407 [2021-03-25 04:35:03,742 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 854 transitions. [2021-03-25 04:35:03,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 854 transitions. [2021-03-25 04:35:03,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:03,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 854 transitions. [2021-03-25 04:35:03,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:35:03,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-25 04:35:03,746 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-25 04:35:03,746 INFO L185 Difference]: Start difference. First operand has 44 places, 36 transitions, 216 flow. Second operand 6 states and 854 transitions. [2021-03-25 04:35:03,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 297 flow [2021-03-25 04:35:03,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 289 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 04:35:03,749 INFO L241 Difference]: Finished difference. Result has 50 places, 33 transitions, 204 flow [2021-03-25 04:35:03,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2021-03-25 04:35:03,749 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2021-03-25 04:35:03,749 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:03,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 33 transitions, 204 flow [2021-03-25 04:35:03,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 33 transitions, 204 flow [2021-03-25 04:35:03,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 33 transitions, 204 flow [2021-03-25 04:35:03,764 INFO L129 PetriNetUnfolder]: 39/140 cut-off events. [2021-03-25 04:35:03,764 INFO L130 PetriNetUnfolder]: For 211/217 co-relation queries the response was YES. [2021-03-25 04:35:03,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 140 events. 39/140 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 609 event pairs, 10 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 436. Up to 47 conditions per place. [2021-03-25 04:35:03,766 INFO L142 LiptonReduction]: Number of co-enabled transitions 246 [2021-03-25 04:35:04,574 WARN L205 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 04:35:04,827 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 04:35:06,028 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 04:35:06,563 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 04:35:07,183 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 04:35:07,442 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:35:08,578 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 04:35:09,085 WARN L205 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 04:35:09,091 INFO L154 LiptonReduction]: Checked pairs total: 347 [2021-03-25 04:35:09,091 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:35:09,092 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5343 [2021-03-25 04:35:09,092 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 211 flow [2021-03-25 04:35:09,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 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-25 04:35:09,092 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:09,092 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:35:09,093 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:35:09,093 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash -845973003, now seen corresponding path program 3 times [2021-03-25 04:35:09,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:09,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111107956] [2021-03-25 04:35:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:09,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:09,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:09,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:09,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:09,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:09,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:09,193 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:35:09,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:35:09,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:09,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:09,201 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-25 04:35:09,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111107956] [2021-03-25 04:35:09,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:09,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:35:09,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44390185] [2021-03-25 04:35:09,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:35:09,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:09,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:35:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:35:09,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2021-03-25 04:35:09,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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-25 04:35:09,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:09,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2021-03-25 04:35:09,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:09,256 INFO L129 PetriNetUnfolder]: 27/102 cut-off events. [2021-03-25 04:35:09,256 INFO L130 PetriNetUnfolder]: For 202/227 co-relation queries the response was YES. [2021-03-25 04:35:09,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 102 events. 27/102 cut-off events. For 202/227 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 1 based on Foata normal form. 28/126 useless extension candidates. Maximal degree in co-relation 383. Up to 37 conditions per place. [2021-03-25 04:35:09,257 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 11 changer transitions 8/37 dead transitions. [2021-03-25 04:35:09,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 37 transitions, 273 flow [2021-03-25 04:35:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:35:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:35:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1089 transitions. [2021-03-25 04:35:09,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8547880690737834 [2021-03-25 04:35:09,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1089 transitions. [2021-03-25 04:35:09,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1089 transitions. [2021-03-25 04:35:09,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:09,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1089 transitions. [2021-03-25 04:35:09,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 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-25 04:35:09,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 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-25 04:35:09,266 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 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-25 04:35:09,266 INFO L185 Difference]: Start difference. First operand has 50 places, 33 transitions, 211 flow. Second operand 7 states and 1089 transitions. [2021-03-25 04:35:09,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 37 transitions, 273 flow [2021-03-25 04:35:09,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 228 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-03-25 04:35:09,269 INFO L241 Difference]: Finished difference. Result has 52 places, 29 transitions, 180 flow [2021-03-25 04:35:09,269 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2021-03-25 04:35:09,269 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2021-03-25 04:35:09,269 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:09,269 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 29 transitions, 180 flow [2021-03-25 04:35:09,269 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 29 transitions, 180 flow [2021-03-25 04:35:09,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 29 transitions, 180 flow [2021-03-25 04:35:09,277 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2021-03-25 04:35:09,277 INFO L130 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2021-03-25 04:35:09,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 58 events. 13/58 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 161 event pairs, 1 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 208. Up to 20 conditions per place. [2021-03-25 04:35:09,278 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-25 04:35:09,572 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-03-25 04:35:09,683 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-03-25 04:35:10,003 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-25 04:35:10,152 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-25 04:35:10,156 INFO L154 LiptonReduction]: Checked pairs total: 330 [2021-03-25 04:35:10,156 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:35:10,156 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 887 [2021-03-25 04:35:10,157 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 166 flow [2021-03-25 04:35:10,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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-25 04:35:10,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:10,157 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] [2021-03-25 04:35:10,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:35:10,157 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1355860002, now seen corresponding path program 1 times [2021-03-25 04:35:10,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:10,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488627368] [2021-03-25 04:35:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:35:10,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:10,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:35:10,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:10,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:10,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:35:10,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:35:10,225 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:35:10,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:35:10,234 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-25 04:35:10,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488627368] [2021-03-25 04:35:10,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:35:10,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:35:10,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720430445] [2021-03-25 04:35:10,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:35:10,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:35:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:35:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:35:10,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 184 [2021-03-25 04:35:10,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 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-25 04:35:10,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:35:10,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 184 [2021-03-25 04:35:10,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:35:10,290 INFO L129 PetriNetUnfolder]: 20/74 cut-off events. [2021-03-25 04:35:10,291 INFO L130 PetriNetUnfolder]: For 272/286 co-relation queries the response was YES. [2021-03-25 04:35:10,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 74 events. 20/74 cut-off events. For 272/286 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 260 event pairs, 1 based on Foata normal form. 10/84 useless extension candidates. Maximal degree in co-relation 289. Up to 25 conditions per place. [2021-03-25 04:35:10,292 INFO L132 encePairwiseOnDemand]: 179/184 looper letters, 4 selfloop transitions, 3 changer transitions 8/32 dead transitions. [2021-03-25 04:35:10,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 32 transitions, 237 flow [2021-03-25 04:35:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:35:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:35:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 850 transitions. [2021-03-25 04:35:10,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.769927536231884 [2021-03-25 04:35:10,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 850 transitions. [2021-03-25 04:35:10,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 850 transitions. [2021-03-25 04:35:10,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:35:10,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 850 transitions. [2021-03-25 04:35:10,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 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-25 04:35:10,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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-25 04:35:10,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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-25 04:35:10,299 INFO L185 Difference]: Start difference. First operand has 45 places, 26 transitions, 166 flow. Second operand 6 states and 850 transitions. [2021-03-25 04:35:10,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 32 transitions, 237 flow [2021-03-25 04:35:10,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 201 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-25 04:35:10,303 INFO L241 Difference]: Finished difference. Result has 44 places, 24 transitions, 125 flow [2021-03-25 04:35:10,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=24} [2021-03-25 04:35:10,303 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2021-03-25 04:35:10,303 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:35:10,303 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 24 transitions, 125 flow [2021-03-25 04:35:10,304 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 24 transitions, 125 flow [2021-03-25 04:35:10,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 125 flow [2021-03-25 04:35:10,309 INFO L129 PetriNetUnfolder]: 8/36 cut-off events. [2021-03-25 04:35:10,309 INFO L130 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2021-03-25 04:35:10,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 36 events. 8/36 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 1 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 99. Up to 12 conditions per place. [2021-03-25 04:35:10,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 04:35:10,463 INFO L154 LiptonReduction]: Checked pairs total: 169 [2021-03-25 04:35:10,463 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:35:10,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-03-25 04:35:10,463 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 117 flow [2021-03-25 04:35:10,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 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-25 04:35:10,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:35:10,464 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-25 04:35:10,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:35:10,464 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:35:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:35:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1949662822, now seen corresponding path program 1 times [2021-03-25 04:35:10,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:35:10,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104044999] [2021-03-25 04:35:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:35:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:35:10,524 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:35:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:35:10,590 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:35:10,627 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:35:10,627 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:35:10,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:35:10,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:35:10 BasicIcfg [2021-03-25 04:35:10,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:35:10,725 INFO L168 Benchmark]: Toolchain (without parser) took 15376.90 ms. Allocated memory was 255.9 MB in the beginning and 656.4 MB in the end (delta: 400.6 MB). Free memory was 232.5 MB in the beginning and 608.7 MB in the end (delta: -376.2 MB). Peak memory consumption was 381.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,725 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:35:10,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.60 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 232.5 MB in the beginning and 357.3 MB in the end (delta: -124.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.61 ms. Allocated memory is still 398.5 MB. Free memory was 357.3 MB in the beginning and 355.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,728 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 398.5 MB. Free memory was 355.2 MB in the beginning and 353.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,729 INFO L168 Benchmark]: RCFGBuilder took 1596.37 ms. Allocated memory is still 398.5 MB. Free memory was 353.1 MB in the beginning and 288.4 MB in the end (delta: 64.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,730 INFO L168 Benchmark]: TraceAbstraction took 13117.98 ms. Allocated memory was 398.5 MB in the beginning and 656.4 MB in the end (delta: 257.9 MB). Free memory was 288.4 MB in the beginning and 608.7 MB in the end (delta: -320.3 MB). Peak memory consumption was 296.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:35:10,734 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.47 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 587.60 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 232.5 MB in the beginning and 357.3 MB in the end (delta: -124.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 39.61 ms. Allocated memory is still 398.5 MB. Free memory was 357.3 MB in the beginning and 355.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 398.5 MB. Free memory was 355.2 MB in the beginning and 353.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1596.37 ms. Allocated memory is still 398.5 MB. Free memory was 353.1 MB in the beginning and 288.4 MB in the end (delta: 64.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13117.98 ms. Allocated memory was 398.5 MB in the beginning and 656.4 MB in the end (delta: 257.9 MB). Free memory was 288.4 MB in the beginning and 608.7 MB in the end (delta: -320.3 MB). Peak memory consumption was 296.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2553.4ms, 105 PlacesBefore, 46 PlacesAfterwards, 97 TransitionsBefore, 37 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2931 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1429, positive: 1340, positive conditional: 0, positive unconditional: 1340, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 783, positive: 760, positive conditional: 0, positive unconditional: 760, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 783, positive: 760, positive conditional: 0, positive unconditional: 760, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1429, positive: 580, positive conditional: 0, positive unconditional: 580, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 783, unknown conditional: 0, unknown unconditional: 783] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1053.3ms, 43 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1374 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 373, positive conditional: 0, positive unconditional: 373, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 467, positive: 325, positive conditional: 0, positive unconditional: 325, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 757.6ms, 36 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 78, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.2ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 155 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 51, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.6ms, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 346 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 89, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.2ms, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 273 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 99, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.6ms, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 302 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 104, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5341.9ms, 50 PlacesBefore, 50 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 87, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 886.7ms, 52 PlacesBefore, 45 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 330 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 96, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.3ms, 44 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t424; [L837] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t425; [L839] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t426; [L841] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L818] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12865.0ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 724.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2631.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 57 SDtfs, 39 SDslu, 37 SDs, 0 SdLazy, 141 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 155.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 144.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=6, InterpolantAutomatonStates: 46, 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: 30.9ms SsaConstructionTime, 357.2ms SatisfiabilityAnalysisTime, 510.8ms InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 845 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...